The trees for which maximum multiplicity implies the simplicity of other eigenvalues

DOI10.1016/J.DISC.2005.04.026MaRDI QIDQ856861zbMATH OpenOpenAlexFDO

Authors Charles R. Johnson, Carlos M. Saiago

Publication date 14 December 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.04.026

zbMATH Keywords

real symmetric matricesvertex degrees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• The multiplicity of eigenvalues of trees
• On the multiplicity of eigenvalues of trees
• 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 multiple eigenvalues of trees
• The property of maximal eigenvectors of trees
• A relation between multiplicity of nonzero eigenvalues of trees and their matching numbers
• On the multiple eigenvalue of Randić matrix of trees
• Trees with a large Laplacian eigenvalue multiplicity
• On the largest eigenvalues of trees

Cites work

• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• Matrix Analysis
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• Spectral multiplicity and splitting results for a class of qualitative matrices
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization

Cited in

(12)

• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• The multiplicity of eigenvalues of trees
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a linear tree
• The graphs for which the maximum multiplicity of an eigenvalue is two
• Implicit construction of multiple eigenvalues for trees
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Algorithmic proof of MaxMult\((T)=p(T)\)
• On the multiple eigenvalue of Randić matrix of trees
• Enumeration of minimum path covers of trees
• Fundamental graphs for the maximum multiplicity of an eigenvalue among Hermitian matrices with a given graph
• Rational realization of maximum eigenvalue multiplicity of symmetric tree sign patterns

This page was built for publication: The trees for which maximum multiplicity implies the simplicity of other eigenvalues

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