Algorithmic proof of MaxMult(T)=p(T)

DOI10.4134/CKMS.2012.27.4.665MaRDI QIDQ4649092zbMATH OpenOpenAlexFDO

Authors In-Jae Kim

Publication date 19 November 2012

Published in Communications of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/ckms.2012.27.4.665

zbMATH Keywords

minimum rankmaximum multiplicitypath cover numbermaximum corank

Mathematics Subject Classification ID

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

Recommendations

• The trees for which maximum multiplicity implies the simplicity of other eigenvalues
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
• On the difference between the maximum multiplicity and path cover number for tree-like graphs

Cited in

(3)

• Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• Rational realization of maximum eigenvalue multiplicity of symmetric tree sign patterns

This page was built for publication: Algorithmic proof of MaxMult\((T)=p(T)\)

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