𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with Connected Medians

✍ Scribed by Bandelt, Hans-Jürgen; Chepoi, Victor

Book ID
118198964
Publisher
Society for Industrial and Applied Mathematics
Year
2002
Tongue
English
Weight
174 KB
Volume
15
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Connected graphs with prescribed median
Connected graphs with prescribed median and periphery
✍ Steven J. Winters 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 605 KB

The eccentricity e(v) of a vertex v in a connected graph G is the distance between v and a vertex furthest from v in G. The center C(G) of G is the subgraph induced by those vertices of G having minimum eccentricity; the periphery P(G) is the subgraph induced by those vertices of G having maximum ec

Medians in median graphs
Medians in median graphs
✍ H.J. Bandelt; J.P. Barthélemy 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 668 KB
Medians of arbitrary graphs
Medians of arbitrary graphs
✍ Peter J. Slater 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

## Abstract For each vertex __u__ in a connected graph __H__, the __distance__ of __u__ is the sum of the distances from __u__ to each of the vertices __v__ of __H.__ A vertex of minimum distance in __H__ is called a __median__ vertex. It is shown that for any graph __G__ there exists a graph __H__

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