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

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.

Gespeichert in:
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!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422
DOI:10.48550/arxiv.1607.03836