A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
arXiv:1607.03836 · doi:10.23638/DMTCS-20-1-25
Abstract
We give a sufficient condition for a degree sequence to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.