✦ LIBER ✦

Distance center and centroid of a median graph

✍ Scribed by Juhani Nieminen

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 459 KB
Volume: 323
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(87)90042-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Center, median, and centroid subgraphs

✍ Smart, Christian; Slater, Peter J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

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. Howeve

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

On Steiner centers and Steiner medians o

On Steiner centers and Steiner medians of graphs

✍ Oellermann, Ortrud R. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

Let G be connected graph and S a set of vertices of G. Then a Steiner tree for S is a connected subgraph of G of smallest size (number of edges) that contains S. The size of such a subgraph is called the Steiner distance for S and is denoted by d(S). For a vertex v of G, and integer n, 2 Յ n Յ ͉V(G)

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

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