Recommendations
- On the multiplicity of eigenvalues of trees
- A relation between multiplicity of nonzero eigenvalues of trees and their matching numbers
- A note on the multiplicities of the eigenvalues of a tree
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
Cites work
Cited in
(36)- Gaussianization of the spectra of graphs and networks. Theory and applications
- Multiplicity of eigenvalues of cographs
- The multiplicities of eigenvalues of a graph
- The multiplicity of eigenvalues of trees
- A note on the multiplicities of the eigenvalues of a tree
- On the multiplicity of positive eigenvalues of a graph
- Characterization of graphs with an eigenvalue of large multiplicity
- Trees with a large Laplacian eigenvalue multiplicity
- On the multiplicity of eigenvalues of trees
- A note on the multiplicities of graph eigenvalues
- A relation between multiplicity of nonzero eigenvalues of trees and their matching numbers
- Trees and acyclic matrices over arbitrary fields
- scientific article; zbMATH DE number 5079740 (Why is no real title available?)
- scientific article; zbMATH DE number 5123568 (Why is no real title available?)
- Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
- State transfer and star complements in graphs
- On the kernel of tree incidence matrices
- Graphs with least eigenvalue -2: ten years on
- On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
- Factoring matrices with a tree-structured sparsity pattern
- On the multiple eigenvalue of Randić matrix of trees
- The multiplicity of eigenvalues of unicyclic graphs
- 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\)
- Minimal graphs with eigenvalue multiplicity of \(n-d\)
- Multiplicity of graph Hermitian eigenvalues
- The multiplicity of nonzero eigenvalues and the induced matching number of a graph
- A characterization of graphs with two types of eigenvalue multiplicities equal to n - d - 1
- New families of trees determined by their spectra
- A relation between multiplicity of 1 as a Laplacian eigenvalue and induced matching numbers in trees
- Multiplicity of nonzero eigenvalues of a tree in terms of domination number or matching number
- The multiplicity of eigenvalues of \(A_{\alpha}\) of trees
- The trees for which maximum multiplicity implies the simplicity of other eigenvalues
- Eigenvalue multiplicity in triangle-free graphs
This page was built for publication: On multiple eigenvalues of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967517)
