4 papers
On the characterization of geometric distance-regular graphs
Chenhui Lv, Jack H. Koolen
In 2010, Koolen and Bang proposed the following conjecture: For a fixed integer , any geometric distance-regular graph with smallest eigenvalue , diameter …
An improved bound for strongly regular graphs with smallest eigenvalue
Jack Koolen, Chenhui Lv, Greg Markowsky +1
In 1979, Neumaier gave a bound on in terms of and , where is the smallest eigenvalue of a primitive strongly regular graph, unless the graph in question belongs to…
A Bose-Laskar-Hoffman theory for -bounded graphs with fixed smallest eigenvalue
Jack H. Koolen, Hong-Jun Ge, Chenhui Lv +1
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…
A characterization of the Grassmann graphs: one missing case
Jack H. Koolen, Chenhui Lv, Alexander L. Gavrilyuk
We prove that the Grassmann graphs , , are characterized by their intersection numbers, which settles one of the few remaining cases.