Integral trees with given nullity
classification
🧮 math.CO
keywords
integralnullitytreesgivenadjacencycalledconsisteigenvalues
read the original abstract
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with nullity 2 and 3 are unique.
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.