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.
An official website of the United States government
Here’s how you know
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.
Brian D. Cloteaux, Michael D. LaMar, Elizabeth R. Moseman, James Shook
Abstract
A digraph whose degree sequences have a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and show them to be equivalent. One of the characterizations is new, and allows for a shorter proof of the equivalence of the two known characterizations as well as proving the final characterization which appears without proof in the literature. Using this result, we obtain a new, short proof of the Fulkerson- Chen theorem on degree sequences of general digraphs.
Cloteaux, B.
, LaMar, M.
, Moseman, E.
and Shook, J.
(2012),
Threshold Digraphs, Siam Journal on Discrete Mathematics, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=912690
(Accessed October 13, 2025)