Multiplicity lists for symmetric matrices whose graphs have few missing edges
type: Item
instance of: scholarly article
title: Multiplicity lists for symmetric matrices whose graphs have few missing edges
zbMATH Open document ID: 1380.15009
author: Charles R. Johnson
author: Yulin Zhang
published in: Linear Algebra and its Applications
publication date: 2018-01-12T00:00:00Z
full work available at URL: http://hdl.handle.net/1822/49137
Mathematics Subject Classification ID: 15A18
Mathematics Subject Classification ID: 15B57
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 6824957
zbMATH Keywords: few missing edges
zbMATH Keywords: multiplicity lists
zbMATH Keywords: real symmetric matrix
zbMATH Keywords: undirected simple graph
MaRDI profile type: Publication
OpenAlex ID: W2775590171
cites work: Q5501701
cites work: Q5746833
cites work: The inverse eigenvalue and inertia problems for minimum rank two graphs
cites work: Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
cites work: Q4040931
cites work: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
cites work: On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
cites work: The Parter--Wiener Theorem: Refinement and Generalization
cites work: 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.
cites work: Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
cites work: Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree
DOI: 10.1016/J.LAA.2017.11.032
description: scientific article; zbMATH DE number 6824957