Transforming Graphs with the Same Degree Sequence

  • Sergey Bereg
  • Hiro Ito
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4535)

Abstract

Let G and H be two graphs with the same vertex set V. It is well known that a graph G can be transformed into a graph H by a sequence of 2-switches if and only if every vertex of V has the same degree in both G and H. We study the problem of finding the minimum number of 2-switches for transforming G into H.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berge, C.: Graphes et hypergraphes, Monographies Universitaires de Mathématiques, vol. 37. Dunod, Paris (1970)Google Scholar
  2. 2.
    Erdős, P., Gallai, T.: Graphs with prescribed degrees of vertices. Mat. Lapok 11, 264–274 (1960)MATHGoogle Scholar
  3. 3.
    Hakimi, S.L.: On the realizability of a set of integers as degrees of the vertices of a graph. SIAM Journal on Applied Mathematics 10, 496–506 (1962)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Havel, V.: A remark on the existence of finite graphs. Časopis pro Pěstováni Matematiky 80, 477–480 (1955) [Czech]MATHGoogle Scholar
  5. 5.
    West, D.: An Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs (1995)Google Scholar
  6. 6.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Sergey Bereg
    • 1
  • Hiro Ito
    • 2
  1. 1.Dept. of Computer ScienceUniversity of Texas at DallasRichardsonUSA
  2. 2.Dept. of Communications and Computer Engineering, School of InformaticsKyoto UniversityKyotoJapan

Personalised recommendations