A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
From MaRDI portal
Publication:6197709
DOI10.1016/j.disc.2023.113845OpenAlexW4389986763MaRDI QIDQ6197709
Jinxing Zhao, Chi Zhang, Zhi-Jun Wang, Dein Wong
Publication date: 19 February 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113845
Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Spectral multiplicity and splitting results for a class of qualitative matrices
- Graphs with nullity \(2c(G)+p(G)-1\)
- Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
- The leaf-free graphs with nullity \(2 c ( G ) - 1\)
- The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
- The Parter--Wiener Theorem: Refinement and Generalization
- On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices
- On the Eigenvalues and Eigenvectors of a Class of Matrices
This page was built for publication: A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices