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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
