Brian Cloteaux - 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 - https://doi.org/10.23638/DMTCS-20-1-25
A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and SumArticle

Authors: Brian Cloteaux ORCID

    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.

    https://doi.org/10.23638/DMTCS-20-1-25
    Source: arXiv.org:1607.03836
    Volume: Vol. 20 no. 1
    Section: Graph Theory
    Published on: June 25, 2018
    Accepted on: June 14, 2018
    Submitted on: March 9, 2017
    Keywords: Mathematics - Combinatorics, 05C07
    Licence: arXiv.org - Non-exclusive license to distribute

    Share and export

    Consultation statistics

    This page has been seen 802 times.
    This article's PDF has been downloaded 456 times.