Average distance, minimum degree, and sp
β
Dankelmann, Peter; Entringer, Roger
π
Article
π
2000
π
John Wiley and Sons
π
English
β 218 KB
The average distance Β΅(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., Β΅(G) = ( n 2 ) -1 {x,y}βV (G) d G (x, y), where V (G) denotes the vertex set of G and d G (x, y) is the distance between x and y. We prove that every connected graph