In this investigation, it is necessary to distinguish pseudographs (self-loops and multiple lines allowed), multigraph (no self-loops but multiple lines are allowed), and graphs (neither self-loop nor multiple lines allowed). The problem of synthesizing graphs, multigraphs, and pseudographs having a prescribed degree sequence was solved by Hakimi. He also determined the conditions under which a connected realization exists in each of these three cases. The case of biconnected (nonseparable) realizations of a degree sequence was given by Hakimi for the case of pseudographs and multigraphs. His methods did not apply to the case of graphs. The triconnected case was solved by Rao and Rao for graphs; however, strangely enough, the biconnected case apparently remains unpublished. We shall show here that the biconnected case can be handled by a "surgery" technique similar in spirit to the connected case given by Hakimi. Several remarks concerning the general n -connected case for pseudographs, multigraphs, and graphs will be given. We conclude with a status report on this subject, which includes the most recent work of Hakimi, Wang and Kleitman, and Bondy.
[1]
F. Harary.
THE MAXIMUM CONNECTIVITY OF A GRAPH.
,
1962,
Proceedings of the National Academy of Sciences of the United States of America.
[2]
Jack Edmonds,et al.
Existence of k-edge connected ordinary graphs with prescribed degrees
,
1964
.
[3]
D. L. Wang,et al.
On the existence of N-connected graphs with prescribed degrees (n ≧ 2)
,
1973,
Networks.
[4]
S. L. Hakimi.
On the Existence of Graphs with Prescribed Degrees and Connectivity
,
1974
.
[5]
F. Boesch,et al.
On graphs of invulnerable communication nets
,
1970
.
[6]
F. T Boesch.
The strongest monotone degree condition for n-connectedness of a graph
,
1974
.
[7]
Francis T. Boesch.
Lower bounds on the vulnerability of a graph
,
1972,
Networks.
[8]
Siddani Bhaskara Rao,et al.
EXISTENCE OF TRICONNECTED GRAPHS WITH PRESCRIBED DEGREES
,
1970
.