Smith normal form and acyclic matrices

DOI10.1007/S10801-008-0121-8zbMATH Open1226.05158arXivmath/0508265OpenAlexW2028657870MaRDI QIDQ1016142FDOQ1016142

Authors: In-Jae Kim, Bryan L. Shader 

Publication date: 4 May 2009

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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).

Full work available at URL: https://arxiv.org/abs/math/0508265

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

zbMATH Keywords

Smith normal formgraph spectraacyclic matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Canonical forms, reductions, classification (15A21)

Cites Work

• Title not available (Why is that?)
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Construction of acyclic matrices from spectral data
• The Parter--Wiener Theorem: Refinement and Generalization
• 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.
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Matrices, Digraphs, and Determinants
• Title not available (Why is that?)
• Minimum-rank matrices with prescribed graph
• Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
• On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
• Paths in directed graphs and spectral properties of matrices

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
• Orthogonal symmetric matrices and joins of graphs
• Title not available (Why is that?)
• A zero forcing technique for bounding sums of eigenvalue multiplicities
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
• Rigid linkages and partial zero forcing

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)