Sesqui-Regular Graphs with Smallest Eigenvalue at Least $-3$
The Electronic Journal of Combinatorics · 2026-08-07 · 33 (3)
DOI: 10.37236/12174 ↗At a glance
Journal article in The Electronic Journal of Combinatorics, published online on 2026-08-07. Written by Qianqian Yang and 4 co-authors.
Abstract (original language)
Koolen Yang and Yang showed that if a graph with smallest eigenvalue at least $-3$ has large minimal valency, then it is $2$-integrable. In this paper, we show that sesqui-regular graphs with smallest eigenvalue at least $-3$ and parameters $(n,k,c)$, where $c \geq9$ and valency $k$ is sufficiently large, are $1$-integrable, and as a consequence we classify them.
Cite
APA
Yang, Q., Gebremichel, B., Rehman, M. U., Yang, J., & Koolen, J. (2026). Sesqui-Regular Graphs with Smallest Eigenvalue at Least $-3$. The Electronic Journal of Combinatorics, 33(3). https://doi.org/10.37236/12174
Vancouver
Yang Q, Gebremichel B, Rehman MU, Yang J, Koolen J. Sesqui-Regular Graphs with Smallest Eigenvalue at Least $-3$. The Electronic Journal of Combinatorics. 2026;33(3). doi:10.37236/12174
BibTeX
@article{Yang2026,
author = {Yang, Qianqian and Gebremichel, Brhane and Rehman, Masood Ur and Yang, Jae-Young and Koolen, Jack},
title = {Sesqui-Regular Graphs with Smallest Eigenvalue at Least $-3$},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {3},
doi = {10.37236/12174}
}
EUVIMED