Traversability of graph space with given degree sequence under edge rewiring

Degree preserving edge rewiring is extensively used in network topology researches to explore the graph space that encompasses all simple graphs with the prescribed degree sequence. The traversability of this graph space under the simple degree preserving rewiring operation is proved and the upper bound rewiring steps required to transform from one graph to the other are given.