An improvement of a result of Zverovich--Zverovich
Grant Cairns, Stacey Mendan
TL;DR
This paper improves a known condition for determining when a decreasing sequence of positive integers can be realized as a graph's degree sequence, enhancing the theoretical understanding of graphical sequences.
Contribution
It provides an improved criterion for the graphicality of degree sequences, refining the previous result by Zverovich and Zverovich.
Findings
Enhanced condition for graphical degree sequences
Broader applicability of the graphicality criterion
Theoretical advancement in graph degree sequence characterization
Abstract
We give an improvement of a result of Zverovich and Zverovich which gives a condition on the first and last elements in a decreasing sequence of positive integers for the sequence to be graphic, that is, the degree sequence of a finite graph.
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.