On the switch-length of two connected graphs with the same degree sequence

Let G be a simple graph containing distinct vertices x, y, z, w such that the edges {x, y}, {z, w} ∈ G and {x, z}, {y, w} ∉ G. The process of deleting the edges {x, y}, {z, w} from G and adding {x, z}, {y, w} to G is referred to as a switch (or 2-switch) in G. Let G₁ and G₂ be two connected simple graphs with the same vertex set V such that for all v ∈ V, the degree of v in G₁ is the same as in G₂ . It is well known that G₂ can be obtained from G₁ by a sequence of switches. Moreover, there is one such sequences of switches with only connected graphs. For some classes of graphs, we study the problem of finding bounds for the minimum number of switches required for transforming G₁ into G₂ such that all graphs in the sequence are connected.