Maximum and minimum nullity of a tree degree sequence [article]

Gonzalo Molina, Daniel A. Jaume
2018 arXiv   pre-print
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.
arXiv:1806.02399v1 fatcat:gs7b4vlhcbhzxanmknfpnlussm