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

dmtcs:2175 - Discrete Mathematics & Theoretical Computer Science, June 25, 2018, Vol. 20 no. 1
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum

Authors: Cloteaux, Brian

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.


Source : oai:arXiv.org:1607.03836
DOI : 10.23638/DMTCS-20-1-25
Volume: Vol. 20 no. 1
Section: Graph Theory
Published on: June 25, 2018
Submitted on: March 9, 2017
Keywords: Mathematics - Combinatorics


Share

Consultation statistics

This page has been seen 103 times.
This article's PDF has been downloaded 59 times.