Threshold Digraphs
From MaRDI portal
Publication:6237770
DOI10.6028/JRES.119.007arXiv1212.1149WikidataQ36134988 ScholiaQ36134988MaRDI QIDQ6237770FDOQ6237770
Authors: Brian D. Cloteaux, M. Drew LaMar, Elizabeth R. Moseman, James M. Shook 
Publication date: 5 December 2012
Abstract: A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations 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.
This page was built for publication: Threshold Digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237770)
