ON THE SUM OF ALL DISTANCES IN GRAPHS

Article Sidebar

PDF
Published: Mar 1, 1994
DOI: https://doi.org/10.5556/j.tkjm.25.1994.4428
Keywords:
sum of all distances connected graph bipartite graphs trees

Main Article Content

IVAN GUTMAN
Faculty of Science, University of Kragujevac, P.O.Box 60, YU-34000 Kragujevac, Yugoslavia.
YEONG-NAN YEH
Institute of Mathematics, Academia Sinica, Taipei 11529, Taiwan, R.O.C.
JIANN-CHERNG CHEN
China Junior College of Industrial and Commercial Mangement, Taipei, Taiwan, R.O.C.

Abstract




The sum $W$ of the distances between all pairs of vertices in a connected graph may be any positive integer, except 2 and 5. We also examine the values that $W$ assumes for connected bipartite graphs and trees.




Article Details

How to Cite
GUTMAN, I., YEH, Y.-N., & CHEN, J.-C. (1994). ON THE SUM OF ALL DISTANCES IN GRAPHS. Tamkang Journal of Mathematics, 25(1), 83–86. https://doi.org/10.5556/j.tkjm.25.1994.4428
Issue
Vol. 25 No. 1 (1994)
Section
Papers
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

References

F. Buckley and F. Harary, "Distance in Graphs", Addison-W esley, Redwood, 1990.

R. C. Entringer, D. E. Jackson and D. A. Snyder, "Distance in graphs", Czech. Math. J., 26 (1976), 283-296.

I. Gutman, "On distance in some bipartite graphs", Pu.bl. Inst. Math. (Beograd), 43 (1988), 3-8.

I. Gutman and O.E. Polansky, "Mathematical Concepts in Organic Chemistry", Springer-Verlag, Berlin, 1986.

J. Plesnik, "On the sum of all distances in a graph or digraph", J. Graph Theory, 8 (1984), 1-21.

L. Soltes, "Transmission in graphs: a bound and vertex removing", Math. Slovaca, 41 (1991), 11-16.

H. Wiener, "Structural determination of paraffin boiling points", J. Amer. Chem. Soc. 69 (1947), 17-20.

Y.-N. Yeh and I. Gutman, "On the sum of all distances in composite graphs", Discrete Math., in press.