✦ LIBER ✦

The w-median of a connected strongly chordal graph

✍ Scribed by Hai-Yen Lee; Gerard J. Chang

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 337 KB
Volume: 18
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190180704

No coin nor oath required. For personal study only.

✦ Synopsis

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‐distance sum D~G,w~(y). This paper shows that the w‐median of a connected strongly chordal graph G is a clique when w(x) is positive for all vertices x in G.

📜 SIMILAR VOLUMES

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 rainbow connectivity of a graph

✍ Gary Chartrand; Garry L. Johns; Kathleen A. McKeon; Ping Zhang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

Deza graphs: A generalization of strongl

Deza graphs: A generalization of strongly regular graph

✍ M. Erickson; S. Fernando; W. H. Haemers; D. Hardy; J. Hemmeter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

Covering the Edges of a Connected Graph

Covering the Edges of a Connected Graph by Paths

✍ L. Pyber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We prove that every connected graph on n vertices can be covered by at most nÂ2+O(n 3Â4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

The Spectra of Complementary Subgraphs i

The Spectra of Complementary Subgraphs in a Strongly Regular Graph

✍ D. de Caen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views