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,