Transforming Graphs with the Same Degree Sequence
- Cite this paper as:
- Bereg S., Ito H. (2008) Transforming Graphs with the Same Degree Sequence. In: Ito H., Kano M., Katoh N., Uno Y. (eds) Computational Geometry and Graph Theory. Lecture Notes in Computer Science, vol 4535. Springer, Berlin, Heidelberg
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.