Multiplicity lists for symmetric matrices whose graphs have few missing edges

DOI10.1016/j.laa.2017.11.032zbMath1380.15009OpenAlexW2775590171MaRDI QIDQ1688915

Charles R. Johnson, Yu Lin Zhang

Publication date: 12 January 2018

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

Full work available at URL: http://hdl.handle.net/1822/49137

zbMATH Keywords

real symmetric matrixundirected simple graphfew missing edgesmultiplicity lists

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (1)

Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• 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.
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• The inverse eigenvalue and inertia problems for minimum rank two graphs
• Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
• 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

This page was built for publication: Multiplicity lists for symmetric matrices whose graphs have few missing edges