Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph

DOI10.1515/spma-2020-0117zbMath1470.05098MaRDI QIDQ2217786

Shahla Nasserasr, Mohammad Adm, Boting Yang, Sarah Plosker, Karen Meagher, Shaun M. Fallat

Publication date: 14 January 2021

Published in: Special Matrices (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/spma-2020-0117

zbMATH Keywords

adjacency matrix; graphs; inverse eigenvalue problem; distinct eigenvalues; minimum rank; multiplicity partition

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A18: Eigenvalues, singular values, and eigenvectors

Related Items

Orthogonal symmetric matrices and joins of graphs

Cites Work

• The nowhere-zero eigenbasis problem for a graph
• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
• The inertia set of the join of graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• Smith normal form and acyclic matrices
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• The inverse eigenvalue problem of a graph: multiplicities and minors
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Graphs that allow all the eigenvalue multiplicities to be even
• Positive semidefinite maximum nullity and zero forcing number
• Graphs whose minimal rank is two
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Minimum number of distinct eigenvalues of graphs