Maximum and minimum nullity of a tree degree sequence
Combinatorics
2018-06-08 v1
Abstract
The nullity of a graph is the multiplicity of the eigenvalue zero in its adjacency spectrum. In this paper, we give a closed formula for the minimum and maximum nullity among trees with the same degree sequence, using the notion of matching number and annihilation number. Algorithms for constructing such minimum-nullity and maximum-nullity trees are described.
Keywords
Cite
@article{arxiv.1806.02399,
title = {Maximum and minimum nullity of a tree degree sequence},
author = {Gonzalo Molina and Daniel A. Jaume},
journal= {arXiv preprint arXiv:1806.02399},
year = {2018}
}
Comments
13 pages and 3 figures