If a graph with minimal degree greater than 1 has two components then performing a 2-switch with one pair in each component yields a connected graph

27 Views Asked by At

If a graph $G$ has two components, and if $\delta (G) > 1$, then performing a 2-switch on one pair of vertices in one component and another pair in the other component gives a connected graph. Is this claim true? Thanks.