Acyclic matrices with a small number of distinct eigenvalues

DOI10.1016/j.laa.2012.08.029zbMath1282.05142OpenAlexW2041403859MaRDI QIDQ389678

Reshmi Nair, Bryan L. Shader

Publication date: 21 January 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.08.029

zbMATH Keywords

diameterHamming distanceSmith normal formacyclic matrixmaximum multiplicity

Mathematics Subject Classification ID

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

Related Items

Inverse eigenvalue problems for two special acyclic matrices ⋮ Inverse eigenvalue problems for acyclic matrices whose graph is a dense centipede ⋮ Generalized inverse eigenvalue problem for matrices whose graph is a path ⋮ The minimax inverse eigenvalue problem for matrices whose graph is a generalized star of depth 2 ⋮ Maximal P-sets of matrices whose graph is a tree ⋮ Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs. ⋮ Unnamed Item

Cites Work

• Unnamed Item
• On acyclic and unicyclic graphs whose minimum rank equals the diameter
• Smith normal form and acyclic matrices
• A characterization of tridiagonal matrices
• Matrix Analysis
• Eigenvectors of acyclic matrices
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components

This page was built for publication: Acyclic matrices with a small number of distinct eigenvalues