Indexed metadata
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum
Brian Cloteaux
Source record
Source: Crossref
Published: Jun 25, 2018
DOI: 10.23638/dmtcs-20-1-25
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.