Title of article
On the average Steiner distance of graphs with prescribed properties Original Research Article
Author/Authors
Peter Dankelmann، نويسنده , , Henda C. Swart، نويسنده , , Ortrud R. Oellermann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
13
From page
91
To page
103
Abstract
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.
Journal title
Discrete Applied Mathematics
Serial Year
1996
Journal title
Discrete Applied Mathematics
Record number
884643
Link To Document