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)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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