Light tails and the Hermitian dual polar graphs

Abstract

Juri\'sic et al. conjectured that if a distance-regular graph with diameter D at least three has a light tail, then one of the following holds: 1.a1 =0; 2. is an antipodal cover of diameter three; 3. is tight; 4. is the halved 2D+1-cube; 5. is a Hermitian dual polar graph 2A2D-1(r) where r is a prime power. In this note, we will consider the case when the light tail corresponds to the eigenvalue -ka1 +1. Our main result is: Theorem Let be a non-bipartite distance-regular graph with valency k ≥ 3 , diameter D ≥ 3 and distinct eigenvalues θ0 > θ1 > ·s > θD. Suppose that is 2-bounded with smallest eigenvalue θD = -ka1 +1. If the minimal idempotent ED, corresponding to eigenvalue θD, is a light tail, then is the dual polar graph 2A2D-1(r), where r is a prime power. As a consequence of this result we will also show: Theorem Let be a distance-regular graph with valency k ≥ 3, diameter D ≥ 2, a1 =1 and θ0 > θ1 > ·s > θD. If c2 ≥5 and θD = -k/2, then c2 =5 and is the dual polar graph 2A2D-1(2).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…