Achievable multiplicity partitions in the inverse eigenvalue problem of a graph

DOI10.1515/spma-2019-0022zbMath1431.05097arXiv1907.11328WikidataQ126589107 ScholiaQ126589107MaRDI QIDQ2302881

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

Publication date: 26 February 2020

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

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

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

Tight Frame Graphs Arising as Line Graphs, Regular graphs of degree at most four that allow two distinct eigenvalues, Sparsity of graphs that allow two distinct eigenvalues, Orthogonal symmetric matrices and joins of graphs, Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph

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
• 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
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Minimum number of distinct eigenvalues of graphs