Skip to main content
SpringerLink
Log in

Graphical degree sequence problems with connectivity requirements

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 762))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Graphes et Hypergraphes, Dunod, 1970.

    Google Scholar 

  2. H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer-Verlag, 1987.

    Google Scholar 

  3. P. Erdös and T. Gallai, Graphs with prescribed degrees of vertices (Hungarian), Mat. Lapok, 11 (1960), 264–274.

    Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. F. Harary, Graph Theory, Addison-Wesley, 1969.

    Google Scholar 

  6. V. Havel, A remark on the existence of finite graphs (Hungarian), časopis PĚst. Mat., 80 (1955), 477–480.

    Google Scholar 

  7. S.B. Rao and A. Ramachandra Rao, Existence of 3-connected graphs with prescribed degrees, Pac. J. Math., 33 (1970), 203–207.

    Google Scholar 

  8. M. Takahashi, K. Imai and T. Asano, Graphical Degree Sequence Problems, Technical Report TR93-AL-33-15, Information Processing Society of Japan, 1993.

    Google Scholar 

  9. K. Thurlasirman and M.N.S. Swamy, Graphs: Theory and Algorithms, John Wilely & Sons, 1992.

    Google Scholar 

  10. P. van Emde Boas, Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, 6 (1977), 80–82.

    Article  Google Scholar 

  11. P. van Emde Boas and E. Zijstra, Design and implementation of an effective priority queue, Math. System Theory, 10 (1977), 99–127.

    Article  Google Scholar 

  12. D.L. Wang and D.J. Kleitman, On the existence of n-Connected Graphs with Prescribed Degrees, Networks, 3 (1973), pp. 225–239.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and System Engineering, Chuo University, Bunkyo-ku, 112, Tokyo, Japan

    Takao Asano

Authors
  1. Takao Asano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. W. Ng P. Raghavan N. V. Balasubramanian F. Y. L. Chin

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation