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.
Cite
CITATION STYLE
APA
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
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free