Threshold Digraphs
- PMID: 26601029
- PMCID: PMC4597423
- DOI: 10.6028/jres.119.007
Threshold Digraphs
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. Using this result, we obtain a new, short proof of the Fulkerson-Chen theorem on degree sequences of general digraphs.
Keywords: Fulkerson-Chen theorem; digraph realizations; threshold digraphs.
Figures
References
-
- Diestel R. Graph theory, Graduate Texts in Mathematics. 4th ed. Vol. 173. Springer; Heidelberg: 2010.
-
- Rao AR, Jana R, Bandyopadhyay S. A Markov chain Monte Carlo method for generating random (0,1)-matrices with given marginals. Sankhyā Ser A. 1996;58(2):225–242. http://sankhya.isical.ac.in/search/58a2/58a2021.pdf.
-
- Mahadev NVR, Peled UN. Threshold graphs and related topics, Annals of Discrete Mathematics. Vol. 56. North-Holland Publishing Co; Amsterdam: 1995.
-
- Berger A. A note on the characterization of digraph sequences. http://arxiv.org/abs/1112.1215.
-
- Berger A. Ph.D. thesis. Martin-Luther-Universität Halle-Wittenberg; 2011. Directed Degree Sequences.
LinkOut - more resources
Full Text Sources
Other Literature Sources