Bipartite graphs with the maximum sum of squares of degrees
Shenggui Zhang, Chuncao Zhou
TL;DR
This paper identifies all bipartite graphs that maximize the sum of squares of degrees for a fixed number of vertices and edges, providing a complete characterization of such extremal graphs.
Contribution
It completely characterizes bipartite graphs with maximum degree sum of squares given fixed vertices and edges, filling a gap in extremal graph theory.
Findings
Identified all extremal bipartite graphs for the maximum degree sum of squares.
Provided a complete classification based on vertex and edge counts.
Contributed to the understanding of degree-based extremal properties in bipartite graphs.
Abstract
In this paper we determine all the bipartite graphs with the maximum sum of squares of degrees among the ones with a given number of vertices and edges.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graph Labeling and Dimension Problems · graph theory and CDMA systems