Strongly Regular Graphs that are Locally a Disjoint Union of Hexagons

The distance-regular graphs such that al

The distance-regular graphs such that all of its second largest local eigenvalues are at most one

✍ Jack H. Koolen; Hyonju Yu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 268 KB

In this paper, we classify distance-regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the first author, who classified the distance-regular graphs wi