Graphs with bipartite complement that admit two distinct eigenvalues

DOI10.13001/ELA.2026.9443MaRDI QIDQ6846168zbMATH OpenFDO

Authors Wayne Barrett, Shaun M. Fallat, Veronika Furst, S. Nasserasr, Brendan Rooney, Michael Tait

Publication date 11 March 2026

Published in ELA. The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.13001/ELA.2026.9443

zbMATH Keywords

\(q\)-parameterinverse eigenvalue problem for graphsorthogonalitystrong spectral property

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29)

Cites work

• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Distinct eigenvalues are realizable with generic eigenvectors
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• Inverse Problems and Zero Forcing for Graphs
• Minimum number of distinct eigenvalues of graphs
• Minimum rank with zero diagonal
• On the minimum semidefinite rank of a simple graph
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Regular graphs of degree at most four that allow two distinct eigenvalues
• Sparsity of graphs that allow two distinct eigenvalues
• The inverse eigenvalue problem of a graph: multiplicities and minors
• The nowhere-zero eigenbasis problem for a graph
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: Graphs with bipartite complement that admit two distinct eigenvalues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846168)