A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The joint degree matrix of a graph gives the number of edges between vertices of degree i and degree j for every pair (i,j). One can perform restricted swap operations to transform a graph into another with the same joint degree matrix. We prove that the space of all realizations of a given joint degree matrix over a fixed vertex set is connected via these restricted swap operations. This was claimed before, but there is an error in the previous proof, which we illustrate by example. We alsodoi:10.1016/j.dam.2014.10.012 fatcat:md4fzuchmnbe5g4iotptiy6mou