Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).

View the beta site
NIST logo

Publication Citation: Threshold Digraphs

NIST Authors in Bold

Author(s): Brian D. Cloteaux; Michael D. LaMar; Elizabeth R. Moseman; James Shook;
Title: Threshold Digraphs
Published: December 05, 2012
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.
Citation: Siam Journal on Discrete Mathematics
Keywords: threshold, digraph, degree sequence, graphicality testing
Research Areas: Modeling
PDF version: PDF Document Click here to retrieve PDF version of paper (115KB)