Towards a classification of 11-homogeneous distance-regular graphs with positive intersection number a1a_1

preprint2026arXivOpen access

Abstract

Let ΓΓ be a graph with diameter at least two. Then ΓΓ is said to be 11-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices xx and yy in ΓΓ, the distance partition of the vertex set of ΓΓ 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 ΓΓ is 11-homogeneous distance-regular with intersection number a1>0a_1>0 and diameter D⩾5D\geqslant 5. Define b=b1/(θ1+1)b=b_1/(θ_1+1), where b1b_1 is the intersection number and θ1θ_1 is the second largest eigenvalue of ΓΓ. We show that if intersection number c2c_2 is at least 22, then b⩾1b\geqslant 1 and one of the following (i)--(vi) holds: (i) ΓΓ is a regular near 2D2D-gon, (ii) ΓΓ is a Johnson graph J(2D,D)J(2D,D), (iii) ΓΓ is a halved ℓ\ell-cube with ℓ∈{2D,2D+1}\ell \in \{2D,2D+1\}, (iv) ΓΓ is a folded Johnson graph Jˉ(4D,2D)\bar{J}(4D,2D), (v) ΓΓ is a folded halved 4D4D-cube, (vi) the valency of ΓΓ 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.