On the sum of all distances in bipartite graphs

Abstract

The transmission of a connected graph G is the sum of all distances between all pairs of vertices in G, it is also called the Wiener index of G. In this paper, sharp bounds on the transmission are determined for several classes of connected bipartite graphs. For example, in the class of all connected n-vertex bipartite graphs with a given matching number q, the minimum transmission is realized only by the graph Kq,n−q; in the class of all connected n-vertex bipartite graphs of diameter d, the extremal graphs with the minimal transmission are characterized. Moreover, all the extremal graphs having the minimal transmission in the class of all connected n-vertex bipartite graphs with a given vertex connectivity (resp. edge-connectivity) are also identified.