加载中…
2016-07-13
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
Brian Cloteaux
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本