On realization graphs of degree sequences

From MaRDI portal




Abstract: Given the degree sequence d of a graph, the realization graph of d is the graph having as its vertices the labeled realizations of d, with two vertices adjacent if one realization may be obtained from the other via an edge-switching operation. We describe a connection between Cartesian products in realization graphs and the canonical decomposition of degree sequences described by R.I. Tyshkevich and others. As applications, we characterize the degree sequences whose realization graphs are triangle-free graphs or hypercubes.



Cites work







This page was built for publication: On realization graphs of degree sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284753)