Smith normal form and acyclic matrices
From MaRDI portal
Publication:1016142
DOI10.1007/s10801-008-0121-8zbMath1226.05158arXivmath/0508265MaRDI QIDQ1016142
Publication date: 4 May 2009
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0508265
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
15A21: Canonical forms, reductions, classification
Related Items
On Orthogonal Matrices with Zero Diagonal, Unordered multiplicity lists of a class of binary trees, Acyclic matrices with a small number of distinct eigenvalues, The minimum rank of symmetric matrices described by a graph: a survey, Mean quantum percolation, A zero forcing technique for bounding sums of eigenvalue multiplicities, Rigid linkages and partial zero forcing, A formula for all minors of the adjacency matrix and an application, Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph, Achievable multiplicity partitions in the inverse eigenvalue problem of a graph, The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic, Diameter minimal trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of acyclic matrices from spectral data
- Paths in directed graphs and spectral properties of matrices
- Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
- On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- Minimum-rank matrices with prescribed graph
- Matrices, Digraphs, and Determinants
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- The Parter--Wiener Theorem: Refinement and Generalization
- On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree