论文信息 - On the Average Steiner Distance of Graphs with Prescribed Properties

On the Average Steiner Distance of Graphs with Prescribed Properties

The average n-distance of a connected graph G, p,,(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on pn for two-connected graphs and for k-chromatic graphs. Moreover, we show that pn(G) does not depend on the n-diameter of G. Let G = (V. E) be a connected graph of order p. The average distance of G, p(G), is defined to be the average of all distances between pairs of vertices in G, i.e.

[1] Ján Plesník,et al. On the sum of all distances in a graph or digraph , 1984, J. Graph Theory.

[2] Gary Chartrand,et al. Steiner distance in graphs , 1989 .

[3] Bohdan Zelinka,et al. Medians and peripherians of trees , 1968 .

[4] Peter Dankelmann. Average Distance and Domination Number , 1997, Discret. Appl. Math..

[5] Ortrud R. Oellermann,et al. The average Steiner distance of a graph , 1996, J. Graph Theory.

[6] M. Plummer. On minimal blocks , 1968 .

[7] Garry L. Johns. Generalized Distance in Graphs , 1988 .

[8] Fan Chung Graham,et al. The average distance and the independence number , 1988, Journal of Graph Theory.

[9] J. K. Doyle,et al. Mean distance in a graph , 1977, Discret. Math..

[10] G. Dirac,et al. Minimally 2-connected graphs. , 1967 .

[11] L. Lovász. Combinatorial problems and exercises , 1979 .

[12] Gary Chartrand,et al. Applied and algorithmic graph theory , 1992 .

[13] Roger C. Entringer,et al. Distance in graphs , 1976 .

[14] Odile Favaron,et al. Edge-vulnerability and mean distance , 1989, Networks.

[15] I. Tomescu,et al. ON DISTANCES IN CHROMATIC GRAPHS , 1989 .