论文信息 - A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs

A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs

One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs. It also studies cases of some simple forbidden edge-sets. Finally, it proves a result which is useful to design an MCMC algorithm to find random realizations of prescribed directed degree sequences.

[1] W. T. Tutte. The Factorization of Linear Graphs , 1947 .

[2] W. T. Tutte. The Factors of Graphs , 1952, Canadian Journal of Mathematics.

[3] W. T. Tutte. A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.

[4] O. Ore. Studies on Directed Graphs, III , 1956 .

[5] D. Gale. A theorem on flows in networks , 1957 .

[6] H. Ryser. Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[7] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[8] S. Hakimi. On the degrees of the vertices of a directed graph , 1965 .

[9] Fred B. Schneider,et al. A Theory of Graphs , 1993 .

[10] D. West. Introduction to Graph Theory , 1995 .

[11] Duncan J. Watts,et al. The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .

[12] Mark E. J. Newman,et al. Structure and Dynamics of Networks , 2009 .

[13] Hyunju Kim,et al. Degree-based graph construction , 2009, 0905.4892.

[14] A. Bonato,et al. Graphs and Hypergraphs , 2022 .