A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices

DOI10.1016/J.DISC.2023.113845MaRDI QIDQ6197709zbMATH OpenOpenAlexFDO

Authors Dein Wong, Jinxing Zhao, Zhijun Wang, Chi Zhang

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

zbMATH Keywords

eigenvalue multiplicitynumber of pendant verticestree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
• The eigenvalue multiplicity of line graphs
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
• On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices

Cites work

• Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\)
• Graphs with nullity \(2c(G)+p(G)-1\)
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
• Spectral multiplicity and splitting results for a class of qualitative matrices
• 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

Cited in

(6)

• Line graphs of trees with the largest eigenvalue multiplicity
• Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices
• Eigenvalue multiplicity of a graph in terms of the number of external vertices
• A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\)
• The eigenvalue multiplicity of line graphs
• Trees with extremal Laplacian eigenvalue multiplicity

This page was built for publication: A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197709)