✦ LIBER ✦

Center, median, and centroid subgraphs

✍ Scribed by Smart, Christian; Slater, Peter J.

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 163 KB
Volume: 34
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199912)34:4<303::aid-net10>3.0.co;2-#

No coin nor oath required. For personal study only.

✦ Synopsis

The median and centroid of an arbitrary graph G are two different generalizations of the branch weight centroid of a tree. As such, they are closely related, but they can actually be disjoint. On the one hand, they are, for example, always contained in the same block of any connected graph G. However, they can be arbitrarily far apart. Specifically, given any three graphs H, J, and K, and a positive integer k Ն 4, there exists a graph G with center, median, and centroid subgraphs isomorphic to H, J, and K, respectively, and the distance between any two of these subgraphs is at least k.

📜 SIMILAR VOLUMES

Distance center and centroid of a median

Distance center and centroid of a median graph

✍ Juhani Nieminen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 459 KB

Centroids and medians of finite metric s

Centroids and medians of finite metric spaces

✍ Hans- JÜRgen Bandelt 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 709 KB

## Abstract The median of a weighted finite metric space consists of the points minimizing the total weighted distance to the points of the space. The centroid is formed by the points __p__ satisfying the following minimax condition: the maximal weight of a geodesically convex set not containing a

Simultaneous embeddings of graphs as med

Simultaneous embeddings of graphs as median and antimedian subgraphs

✍ K. Balakrishnan; B. Brešar; M. Kovše; M. Changat; A.R. Subhamathi; S. Klavžar 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

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

Conditional centers and medians of a gra

Conditional centers and medians of a graph

✍ Edward Minieka 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB

Directed distance in digraphs: Centers a

Directed distance in digraphs: Centers and medians

✍ Gary Chartrand; Garry L. Johns; Songlin Tian; Steven J. Winters 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 513 KB

## Abstract The directed distance __d__~__D__~(__u, v__) from a vertex __u__ to a vertex __v__ in a strong digraph __D__ is the length of a shortest (directed) __u ‐ v__ path in __D.__ The eccentricity of a vertex __v__ in __D__ is the directed distance from __v__ to a vertex furthest from __v.__ T