Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A Sufficient Conditi ...
Article

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

Brian Cloteaux ORCID
Download article
Open on arXiv
Submitted on
March 9, 2017
Accepted on
June 14, 2018
Published on
June 25, 2018
Last modified on
March 31, 2025
Volume 20
Vol. 20:1
Graph Theory
DOI
10.23638/DMTCS-20-1-25
License
arXiv.org - Non-exclusive license to distribute
Indicators
1129
Views
697
Downloads

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

Brian Cloteaux ORCID
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.
Keywords
  • Mathematics - Combinatorics
  • 05C07
Cited by

Source: OpenCitations

  • Applied and Computational Mathematics Division:

    Authors : Ronald F Boisvert ORCID

    Journal reference : Volume , 2020, pp.

    DOI : 10.6028/nist.ir.8306

  • Applied and computational mathematics division:

    Authors : Ronald F Boisvert ORCID

    Journal reference : Volume , 2019, pp.

    DOI : 10.6028/nist.ir.8251
Preview
Loading PDF preview...