Abstract
A sequence of integers D=(d 1, d 2,..., d n) is k-conneted graphical if there is a k-connected graph with vertices v 1, v 2,..., v n such that deg(v i)=d i for each i=1,2,..., n. The k-connected graphical degree sequence problem is: Given a sequence D of integers, determine whether it is k-connected graphical or not, and, if so, construct a graph with D as its degree sequence. In this paper, we consider the k-connected graphical degree sequence problem and present an O(n log log n) time algorithm.
Supported in part by Grant in Aid for Scientific Research of the Ministry of Education, Science and Culture of Japan and by the Alexander von Humboldt Foundation.
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, Graphes et Hypergraphes, Dunod, 1970.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.
P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok, 11 (1960), 264–274.
S. Hakimi, On the realizability of a set of integers as degrees of the vertices of a graph, J. SIAM Appl. Math., 10 (1962), 496–506.
F. Harary, Graph Theory, Addison-Wesley, 1969.
V. Havel, A remark on the existence of finite graphs (Hungarian), časopis PĚst. Mat., 80 (1955), 477–480.
S.B. Rao and A. Ramachandra Rao, Existence of 3-connected graphs with prescribed degrees, Pac. J. Math., 33 (1970), 203–207.
M. Takahashi, K. Imai and T. Asano, Graphical Degree Sequence Problems, Technical Report TR93-AL-33-15, Information Processing Society of Japan, 1993.
K. Thurlasirman and M.N.S. Swamy, Graphs: Theory and Algorithms, John Wilely & Sons, 1992.
P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, 6 (1977), 80–82.
P. van Emde Boas and E. Zijstra, Design and implementation of an effective priority queue, Math. System Theory, 10 (1977), 99–127.
D.L. Wang and D.J. Kleitman, On the existence of n-Connected Graphs with Prescribed Degrees, Networks, 3 (1973), pp. 225–239.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asano, T. (1993). Graphical degree sequence problems with connectivity requirements. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds) Algorithms and Computation. ISAAC 1993. Lecture Notes in Computer Science, vol 762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57568-5_233
Download citation
DOI: https://doi.org/10.1007/3-540-57568-5_233
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57568-9
Online ISBN: 978-3-540-48233-8
eBook Packages: Springer Book Archive