NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

A Sufficient Condition for Graphic Sequences with Fixed Largest and Smallest Entries and Sum

Published

Author(s)

Brian D. Cloteaux

Abstract

We give a sufficient condition for a nonnegative integer list to be graphic based on its largest and smallest elements, length, and sum. This bound generalizes a result of Zverovich and Zverovich.
Citation
Discrete Mathematics and Theoretical Computer Science
Volume
20
Issue
1
Pub Type
Journals

Download Paper

Local Download

Keywords

degree sequence, graphic sequence
Modeling and simulation research and Numerical methods and software

Citation

Cloteaux, B. (2018), A Sufficient Condition for Graphic Sequences with Fixed Largest and Smallest Entries and Sum, Discrete Mathematics and Theoretical Computer Science, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=921202 (Accessed October 8, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created June 25, 2018, Updated June 26, 2018
Was this page helpful?