On connected degree sequences
classification
🧮 math.CO
keywords
conditionsconnecteddegreenecessarysequencesufficientalternativecharacterisation
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.