ON THE AVERAGE STEINER DISTANCE OF GRAPHS WITH PRESCRIBED PROPERTIES

The average n-distance of a connected graph G, mu(n)(G), is the averag e of the Steiner distances of all n-sets of vertices of G. In this pap er, we give bounds on mu(n) for two-connected graphs and for k-chromat ic graphs. Moreover, we show that mu(n)(G) does not depend on the n-di ameter of G.