Graphs with bipartite complement that admit two distinct eigenvalues
The Electronic Journal of Linear Algebra · 04.03.2026 · 42 · 146-161
DOI: 10.13001/ela.2026.9443 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Linear Algebra, online erschienen am 04.03.2026. Verfasst von Wayne Barrett und 5 weiteren Autor:innen.
Abstract (Originalsprache)
The parameter $q(G)$ of an $n$-vertex graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. We show that all $G$ with $e(\overline{G}) = |E(\overline{G})| \leq \lfloor n/2 \rfloor -1$ have $q(G)=2$. We conjecture that any $G$ with $e(\overline{G}) \leq n-3$ satisfies $q(G) = 2$. We show that this conjecture is true if $\overline{G}$ is bipartite and in other sporadic cases. Furthermore, we characterize $G$ with $\overline{G}$ bipartite and $e(\overline{G}) = n-2$ for which $q(G) > 2$.
Zitieren
APA
Barrett, W., Fallat, S., Furst, V., Nasserasr, S., Rooney, B., & Tait, M. (2026). Graphs with bipartite complement that admit two distinct eigenvalues. The Electronic Journal of Linear Algebra, 42, 146-161. https://doi.org/10.13001/ela.2026.9443
Vancouver
Barrett W, Fallat S, Furst V, Nasserasr S, Rooney B, Tait M. Graphs with bipartite complement that admit two distinct eigenvalues. The Electronic Journal of Linear Algebra. 2026;42:146-161. doi:10.13001/ela.2026.9443
BibTeX
@article{Barrett2026,
author = {Barrett, Wayne and Fallat, Shaun and Furst, Veronika and Nasserasr, Shahla and Rooney, Brendan and Tait, Michael},
title = {Graphs with bipartite complement that admit two distinct eigenvalues},
journal = {The Electronic Journal of Linear Algebra},
year = {2026},
volume = {42},
pages = {146--161},
doi = {10.13001/ela.2026.9443}
}
EUVIMED