Transforming Graphs with the Same Degree Sequence

* Final gross prices may vary according to local VAT.

Get Access

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.