A Sufficient Condition for Graphic Sequences with Given Largest and   Smallest Entries, Length, and Sum
  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. 
Brian Cloteaux
math.CO