A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum

Discret Math Theor Comput Sci. 2018:20:10.23638/DMTCS-20-1-25. doi: 10.23638/DMTCS-20-1-25.

Abstract

We give a sufficient condition for a nonnegative integer list to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.

Keywords: degree sequence.