A sharp refinement of a result of Zverovich-Zverovich

作者：Cairns Grant^*; Mendan Stacey; Nikolayevsky Yuri

来源：Discrete Mathematics, 2015, 338(7): 1085-1089.

DOI：10.1016/j.disc.2015.02.001

• Graph
• Vertex degree
• Graphic sequence

For a finite sequence of positive integers to be the degree sequence of a finite graph, Zverovich and Zverovich gave a sufficient condition involving only the length of the sequence, its largest entry and its smallest entry. Barrus, Hartke, Jao, and West gave a better bound and showed that the sharp bound is never less than theirs by more than 1. In this paper we determine the sharp bound.

• 出版日期2015-7-6