Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871379 | Discrete Applied Mathematics | 2018 | 7 Pages |
Abstract
Denote the sum of squares of all distances between all pairs of vertices in G by S(G). In this paper, sharp bounds on the S(G) are determined for several classes of connected bipartite graphs. All the extremal graphs having the minimal S(G) in the class of all connected n-vertex bipartite graphs with a given vertex connectivity (resp. edge-connectivity) can be identified.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xianya Geng, Hongjin Zhao,