✦ LIBER ✦

Representations of chordal graphs as subtrees of a tree

✍ Scribed by James R. Walter

Publisher: John Wiley and Sons
Year: 1978
Tongue: English
Weight: 140 KB
Volume: 2
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190020311

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the tree representation of chordal gr

On the tree representation of chordal graphs

✍ Yukio Shibata 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB 👁 1 views

A generalization of chordal graphs

✍ P. D. Seymour; R. W. Weaver 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 487 KB

In a 3-connected planar triangulation, every circuit of length 2 4 divides the rest of the edges into two nontrivial parts (inside and outside) which are "separated" by the circuit. Neil Robertson asked to what extent triangulations are characterized by this property, and conjectured an answer. In t

The subtree center of a tree

✍ Nieminen, Juhani; Peltola, Matti 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 2 views

A method to determine the least central subtree of a tree is given. The structure of the trees having a single point as a least central subtree is described, and the relation of a least central subtree of a tree to the centroid as well as to the center of that tree is given.

Least central subtrees, center, and cent

Least central subtrees, center, and centroid of a tree

✍ Martti Hamina; Matti Peltola 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

On the interval number of a chordal grap

On the interval number of a chordal graph

✍ Edward R. Scheinerman 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB 👁 2 views

The interval number of a (simple, undirected) graph G is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t real intervals. A chordal (or triangulated) graph is one with no induced cycles on 4 or more vertices. If G is chordal and has maximum

The w-median of a connected strongly cho

The w-median of a connected strongly chordal graph

✍ Hai-Yen Lee; Gerard J. Chang 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 1 views

## Abstract Suppose __G = (V, E)__ is a graph in which every vertex __x__ has a non‐negative real number __w(x)__ as its weight. The __w__‐distance sum of a vertex __y__ is __D~G, w~(y)__ = σ~x≅v~ __d(y, x)w(x).__ The __w__‐median of __G__ is the set of all vertices __y__ with minimum __w__‐distanc