Light tails and the Hermitian dual polar graphs

preprint2015arXivOpen access

Abstract

Juriśič et al. conjectured that if a distance-regular graph ΓΓ with diameter DD at least three has a light tail, then one of the following holds: 1.a1=0a_1 =0; 2.ΓΓ is an antipodal cover of diameter three; 3.ΓΓ is tight; 4.ΓΓ is the halved 2D+12D+1-cube; 5.ΓΓ is a Hermitian dual polar graph 2A2D−1(r)^2A_{2D-1}(r) where rr is a prime power. In this note, we will consider the case when the light tail corresponds to the eigenvalue −ka1+1-\frac{k}{a_1 +1}. Our main result is: Theorem Let ΓΓ be a non-bipartite distance-regular graph with valency k≥3k \geq 3 , diameter D≥3D \geq 3 and distinct eigenvalues θ0>θ1>⋯>θDθ_0 > θ_1 > \cdots > θ_D. Suppose that ΓΓ is 22-bounded with smallest eigenvalue θD=−ka1+1θ_D = -\frac{k}{a_1 +1}. If the minimal idempotent EDE_D, corresponding to eigenvalue θDθ_D, is a light tail, then ΓΓ is the dual polar graph 2A2D−1(r)^2A_{2D-1}(r), where rr is a prime power. As a consequence of this result we will also show: Theorem Let ΓΓ be a distance-regular graph with valency k≥3k \geq 3, diameter D≥2D \geq 2, a1=1a_1 =1 and θ0>θ1>⋯>θDθ_0 > θ_1 > \cdots > θ_D. If c2≥5c_2 \geq5 and θD=−k/2θ_D = -k/2, then c2=5c_2 =5 and ΓΓ is the dual polar graph 2A2D−1(2)^2A_{2D-1}(2).

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.