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.
No takes yet. Share an insight, caveat, or question.
Gutman et al. (1994) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: