论文信息 - Threshold Digraphs

Threshold Digraphs

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.

[1] Annabell Berger. Directed degree sequences , 2011 .

[2] A. Rao,et al. A Markov chain Monte carol method for generating random (0, 1)-matrices with given marginals , 1996 .

[3] Tom Roby,et al. THE LATTICE OF THRESHOLD GRAPHS , 2005 .

[4] Michael Drew Lamar,et al. Split digraphs , 2010, Discret. Math..

[5] N. Mahadev,et al. Threshold graphs and related topics , 1995 .

[6] Wai-Kai Chen. On the realization of a (p,s)-digraph with prescribed degrees , 1966 .

[7] Daniel J. Kleitman,et al. Algorithms for constructing graphs and digraphs with given valences and factors , 1973, Discret. Math..

[8] D. R. Fulkerson. Zero-one matrices with zero trace. , 1960 .

[9] Frank Harary,et al. Graph Theory , 2016 .

[10] Olivier Cogis,et al. Ferrers digraphs and threshold graphs , 1982, Discret. Math..

[11] I. Olkin,et al. Inequalities: Theory of Majorization and Its Applications , 1980 .