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

Discrete Mathematics & Theoretical Computer Science, Vol. 20 no. 1, Graph Theory (June 25, 2018) dmtcs:2175 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.

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2018-06
1. Verfasser:	Cloteaux, Brian
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!