On realization graphs of degree sequences

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 r...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 339; no. 8; pp. 2146 - 2152
Main Author Barrus, Michael D.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.08.2016
Subjects
Canonical decomposition
Cartesian
Decomposition
Degree sequence
Graph theory
Graphs
Hypercubes
Mathematical analysis
Realization graph
Sequences
Realization graph
Canonical decomposition
Degree sequence
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2016.03.012