On the average Steiner distance of graphs with prescribed properties Original Research Article

The average n-distance of a connected graph G, μn(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on μn for two-connected graphs and for k-chromatic graphs. Moreover, we show that μn(G) does not depend on the n-diameter of G.