On the Sum of the Largest and Smallest Eigenvalue of Odd-Cycle Free Fraphs
The Electronic Journal of Combinatorics · 2026-05-08 · 33 (2)
DOI: 10.37236/14427 ↗At a glance
Journal article in The Electronic Journal of Combinatorics, published online on 2026-05-08. Written by Aida Abiad and 2 co-authors.
Abstract (original language)
Let $G$ be a graph with adjacency eigenvalues $\lambda_1 \geq \cdots \geq \lambda_n$. Both $\lambda_1 + \lambda_n$ and the odd girth of $G$ can be seen as measures of the bipartiteness of $G$. Csikvári proved in 2022 that for odd girth 5 graphs (triangle-free) it holds that $(\lambda_1+\lambda_n)/n \le (3-2\sqrt 2) < 0.1716$. In this paper we extend Csikvári's result to general odd girth $k$ proving that $(\lambda_1+\lambda_n)/n = O(k^{-1})$. In the case of odd girth 7, we prove a stronger upper bound of $(\lambda_1+\lambda_n)/n < 0.0396$.
Cite
APA
Abiad, A., Taranchuk, V., & Veluw, T. V. (2026). On the Sum of the Largest and Smallest Eigenvalue of Odd-Cycle Free Fraphs. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14427
Vancouver
Abiad A, Taranchuk V, Veluw TV. On the Sum of the Largest and Smallest Eigenvalue of Odd-Cycle Free Fraphs. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14427
BibTeX
@article{Abiad2026,
author = {Abiad, Aida and Taranchuk, Vladislav and Veluw, Thijs Van},
title = {On the Sum of the Largest and Smallest Eigenvalue of Odd-Cycle Free Fraphs},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14427}
}
EUVIMED