Towards a classification of 1-homogeneous distance-regular graphs with positive intersection number a1
Abstract
Let be a graph with diameter at least two. Then is said to be 1-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices x and y in , the distance partition of the vertex set of with respect to both x and y is equitable, and the parameters corresponding to equitable partitions are independent of the choice of x and y. Assume that is 1-homogeneous distance-regular with intersection number a1>0 and diameter D≥slant 5. Define b=b1/(θ1+1), where b1 is the intersection number and θ1 is the second largest eigenvalue of . We show that if intersection number c2 is at least 2, then b≥slant 1 and one of the following (i)--(vi) holds: (i) is a regular near 2D-gon, (ii) is a Johnson graph J(2D,D), (iii) is a halved -cube with ∈ \2D,2D+1\, (iv) is a folded Johnson graph J(4D,2D), (v) is a folded halved 4D-cube, (vi) the valency of is bounded by a function of b. Using this result, we characterize 1-homogeneous graphs with classical parameters and a1>0, as well as tight distance-regular graphs.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.