Integral trees with given nullity
From MaRDI portal
Publication:501045
DOI10.1016/J.DISC.2015.08.007zbMATH Open1322.05089arXiv1207.1802OpenAlexW1577490800MaRDI QIDQ501045FDOQ501045
Authors: B. Tayfeh-Rezaie, E. Ghorbani, A. Mohammadian
Publication date: 8 October 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1207.1802
Recommendations
Cites Work
- Title not available (Why is that?)
- Spectra of graphs
- An introduction to the theory of graph spectra
- Title not available (Why is that?)
- A survey on integral graphs
- Title not available (Why is that?)
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Spectral multiplicity and splitting results for a class of qualitative matrices
- Nullity of graphs: an updated survey
- Small integral trees
- Integral trees of odd diameters
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integral trees of arbitrarily large diameters
Cited In (9)
- Integral trees homeomorphic to a double star
- On \((k+1)\)-line graphs of \(k\)-trees and their nullities
- On integral graphs with few cycles
- Title not available (Why is that?)
- Trees with maximum nullity
- Title not available (Why is that?)
- A Bailey tree for integrals
- Null decomposition of trees
- Tree composition condition and moments vanishing
This page was built for publication: Integral trees with given nullity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501045)