Smith normal form and acyclic matrices
From MaRDI portal
Publication:1016142
Abstract: An approach, based on the Smith Normal Form, is introduced to study the spectra of symmetric matrices with a given graph. The approach serves well to explain how the path cover number (resp. diameter of a tree T) is related to the maximum multiplicity occurring for an eigenvalue of a symmetric matrix whose graph is T (resp. the minimum number q(T) of distinct eigenvalues over the symmetric matrices whose graphs are T). The approach is also applied to a more general class of connected graphs G, not necessarily trees, in order to establish a lower bound on q(G).
Recommendations
- Acyclic matrices with a small number of distinct eigenvalues
- On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
- Smith normal form and Laplacians
- Eigenvalues and the Smith normal form
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3327313 (Why is no real title available?)
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
- Construction of acyclic matrices from spectral data
- Eigenvectors of acyclic 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.
- Matrices, Digraphs, and Determinants
- Minimum-rank matrices with prescribed graph
- On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
- 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
- On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
- Paths in directed graphs and spectral properties of matrices
- The Parter--Wiener Theorem: Refinement and Generalization
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
Cited in
(19)- Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- Smith normal form of augmented degree matrix and its applications
- Diameter minimal trees
- Acyclic matrices with a small number of distinct eigenvalues
- A formula for all minors of the adjacency matrix and an application
- On orthogonal matrices with zero diagonal
- Mean quantum percolation
- Smith normal form of a multivariate matrix associated with partitions
- Spectral arbitrariness for trees fails spectacularly
- Skew-Hadamard matrices and the Smith normal form
- Unordered multiplicity lists of a class of binary trees
- The minimum rank of symmetric matrices described by a graph: a survey
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
- The Smith normal form of a specialized Giambelli-type matrix
- scientific article; zbMATH DE number 15247 (Why is no real title available?)
- Orthogonal symmetric matrices and joins of graphs
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- Rigid linkages and partial zero forcing
- The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
This page was built for publication: Smith normal form and acyclic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016142)