On connected degree sequences
Combinatorics
2015-12-01 v1
Abstract
This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these necessary and sufficient conditions is also given.
Keywords
Cite
@article{arxiv.1511.09321,
title = {On connected degree sequences},
author = {Jonathan McLaughlin},
journal= {arXiv preprint arXiv:1511.09321},
year = {2015}
}
Comments
7 pages, 4 figures