𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Average distance in weighted graphs

✍ Scribed by Peter Dankelmann

Book ID
113567295
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
222 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Average distance in colored graphs
Average distance in colored graphs
✍ Peter Dankelmann; Wayne Goddard; Peter Slater πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 143 KB

## Abstract For a graph __G__ where the vertices are colored, the __colored distance__ of __G__ is defined as the sum of the distances between all unordered pairs of vertices having different colors. Then for a fixed supply __s__ of colors, __d~s~(G)__ is defined as the minimum colored distance ove

The average Steiner distance of a graph
The average Steiner distance of a graph
✍ Dankelmann, Peter; Oellermann, Ortrud R.; Swart, Henda C. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 384 KB πŸ‘ 2 views

The average distance p(G) of a graph G is the average among the distances between all pairs of vertices in G. For n 2 2, the average Steiner n-distance ,4G) of a connected graph G is the average Steiner distance over all sets of n vertices in G. It is shown that for a connected weighted graph G, pu,

Weighted connected domination and Steine
Weighted connected domination and Steiner trees in distance-hereditary graphs
✍ Yeh Hong-Gwa; Gerard J. Chang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 649 KB

Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted c