Sparsity of graphs that allow two distinct eigenvalues

DOI10.1016/j.laa.2023.06.004zbMath1518.05111arXiv2206.08860MaRDI QIDQ6173926

Shaun M. Fallat, Brendan Rooney, Michael Tait, Franklin H. J. Kenter, Hein van der Holst, Shahla Nasserasr, Veronika Furst, Wayne W. Barrett

Publication date: 13 July 2023

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

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

zbMATH Keywords

orthogonality; inverse eigenvalue problem for graphs; \(q\)-parameter

Mathematics Subject Classification ID

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

15A18: Eigenvalues, singular values, and eigenvectors

15A29: Inverse problems in linear algebra

05C42: Density (toughness, etc.)

Related Items

Regular graphs of degree at most four that allow two distinct eigenvalues

Cites Work

• Unnamed Item
• Edge sets contained in circuits
• Combinatorially orthogonal matrices and related graphs
• 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
• 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
• Kronecker products of fully indecomposable matrices and of ultrastrong digraphs
• Minimum number of distinct eigenvalues of graphs