An important and basic characterization of a graph is the sequence or list of degrees of that graph. Problems regarding the construction of graphs with specified degrees occur in chemistry and in the design of reliable networks. A list of nonnegative integers is called graphical if there is a graph (called a realization) with the given list as its degree list. The usual algorithms for determining whether a given list is graphical are derived from the effect on a graphical list of the removal of a point from a graph. After reviewing such an algorithm by Havel-Hakimi and its generalization by Wang and Kleitman, we develop a corresponding algorithm based on the removal of a line from a graph. We conclude by reviewing and providing simple proofs of algorithms for a list to be multigraphical due to Hakimi and Butler. The conditions relating a graphical or multigraphical list to the point and line connectivity of their realizations, due to Edmonds, Wang and Kleitman, Boesch and McHugh, and Hakimi, are presented along with new and simple proofs of the multigraph case.
[1]
S. Hakimi.
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
,
1962
.
[2]
D. Kleitman,et al.
A Note on n-Edge-Connectivity
,
1974
.
[3]
Wushow Chou,et al.
Survivable communication networks and the terminal capacity matrix
,
1970
.
[4]
H. Frank,et al.
Connectivity considerations in the design of survivable networks
,
1970
.
[5]
James A. M. McHugh,et al.
Synthesis of biconnected graphs
,
1974
.
[6]
F. Harary.
THE MAXIMUM CONNECTIVITY OF A GRAPH.
,
1962,
Proceedings of the National Academy of Sciences of the United States of America.
[7]
D. L. Wang,et al.
On the existence of N-connected graphs with prescribed degrees (n ≧ 2)
,
1973,
Networks.
[8]
Jack Edmonds,et al.
Existence of k-edge connected ordinary graphs with prescribed degrees
,
1964
.
[9]
S. L. Hakimi.
On the Existence of Graphs with Prescribed Degrees and Connectivity
,
1974
.