Computational Geometry and Graph Theory

Volume 4535 of the series Lecture Notes in Computer Science pp 25-32

Transforming Graphs with the Same Degree Sequence

  • Sergey BeregAffiliated withDept. of Computer Science, University of Texas at Dallas
  • , Hiro ItoAffiliated withDept. of Communications and Computer Engineering, School of Informatics, Kyoto University

* Final gross prices may vary according to local VAT.

Get Access


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.