paper

A Bose-Laskar-Hoffman theory for -bounded graphs with fixed smallest eigenvalue

arXiv:2502.05520

Abstract

In 2018, by Ramsey and Hoffman theory, Koolen, Yang, and Yang presented a structural result on graphs with smallest eigenvalue at least and large minimum degree. In this study, we depart from the conventional use of Ramsey theory and instead employ a novel approach that combines the Bose-Laskar type argument with Hoffman theory to derive structural insights into -bounded graphs with fixed smallest eigenvalue. Our method establishes a reasonable bound on the minimum degree. Note that local graphs of distance-regular graphs are -bounded. We apply these results to characterize the structure for any local graph of a distance-regular graph with classical parameters . Consequently, we show that the parameter is bounded by a cubic polynomial in if and . We also show that if and .

A Bose-Laskar-Hoffman theory for $μ$-bounded graphs with fixed smallest eigenvalue · wovepaper