English

Towards a classification of $1$-homogeneous distance-regular graphs with positive intersection number $a_1$

Combinatorics 2026-01-15 v5

Abstract

Let Γ\Gamma be a graph with diameter at least two. Then Γ\Gamma is said to be 11-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices xx and yy in Γ\Gamma, the distance partition of the vertex set of Γ\Gamma with respect to both xx and yy is equitable, and the parameters corresponding to equitable partitions are independent of the choice of xx and yy. Assume that Γ\Gamma is 11-homogeneous distance-regular with intersection number a1>0a_1>0 and diameter D5D\geqslant 5. Define b=b1/(θ1+1)b=b_1/(\theta_1+1), where b1b_1 is the intersection number and θ1\theta_1 is the second largest eigenvalue of Γ\Gamma. We show that if intersection number c2c_2 is at least 22, then b1b\geqslant 1 and one of the following (i)--(vi) holds: (i) Γ\Gamma is a regular near 2D2D-gon, (ii) Γ\Gamma is a Johnson graph J(2D,D)J(2D,D), (iii) Γ\Gamma is a halved \ell-cube with {2D,2D+1}\ell \in \{2D,2D+1\}, (iv) Γ\Gamma is a folded Johnson graph Jˉ(4D,2D)\bar{J}(4D,2D), (v) Γ\Gamma is a folded halved 4D4D-cube, (vi) the valency of Γ\Gamma is bounded by a function of bb. Using this result, we characterize 11-homogeneous graphs with classical parameters and a1>0a_1>0, as well as tight distance-regular graphs.

Keywords

Cite

@article{arxiv.2404.01134,
  title  = {Towards a classification of $1$-homogeneous distance-regular graphs with positive intersection number $a_1$},
  author = {Jack H. Koolen and Mamoon Abdullah and Brhane Gebremichel and Jae-Ho Lee},
  journal= {arXiv preprint arXiv:2404.01134},
  year   = {2026}
}

Comments

21 pages, 1 figure