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

TL;DR

This paper introduces a new theoretical approach combining Bose-Laskar and Hoffman theories to analyze $$-bounded graphs with fixed smallest eigenvalues, providing bounds on parameters of local graphs in distance-regular graphs.

Contribution

It develops a novel method that departs from traditional Ramsey theory, offering structural insights and bounds for $$-bounded graphs with fixed smallest eigenvalues.

Findings

Bound on the minimum degree of $$-bounded graphs established.

Parameter $$ is bounded by a cubic polynomial in $b$ for certain distance-regular graphs.

Parameter $$ is at most 2 when $b=2$ and $D \u2265 12$.

Abstract

In 2018, by Ramsey and Hoffman theory, Koolen, Yang, and Yang presented a structural result on graphs with smallest eigenvalue at least $-3$ 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 $\mu$-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 $\mu$-bounded. We apply these results to characterize the structure for any local graph of a distance-regular graph with classical parameters $(D,b,\alpha,\beta)$. Consequently, we show that the parameter $\alpha$ is bounded by a cubic polynomial in $b$ if $D \geq 9$ and $b \geq 2$. We also show that $\alpha \leq 2$ if $b =2$ and $D \geq 12$.