Graph reconstruction and generation from one card and the degree sequence
Combinatorics
2018-10-08 v1
Abstract
Many degree sequences can only be realised in graphs that contain a `ds-completable card', defined as a vertex-deleted subgraph in which the erstwhile neighbours of the deleted vertex can be identified from their degrees, if one knows the degree sequence of the original graph. We obtain conditions on the degree sequence, such that graphs whose degree sequence satisfies one of the conditions must contain such a card. The methods allow all such sequences on graphs of order up to 10 to be identified, and some fraction of the sequences for larger graphs. Among other applications, this can be used to reduce the computational task of generating graphs of a given degree sequence without duplicates.
Keywords
Cite
@article{arxiv.1810.02602,
title = {Graph reconstruction and generation from one card and the degree sequence},
author = {Andrew M. Steane},
journal= {arXiv preprint arXiv:1810.02602},
year = {2018}
}
Comments
24 pages