3-bounded property in a triangle-free distance-regular graph

2007/09/05 by Yeh-Jong Pan, Yeh-jong Pan, Pan, Yeh-jong +2
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Finite Group Theory Research #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.0709.0564

13 pages

arxiv created 2007/09/05 · arxiv updated 2009/12/01

Abstract

Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D≥ 3. Assume the intersection numbers a₁=0 and a₂\not=0. We show Γ is 3-bounded in the sense of the article [D-bounded distance-regular graphs, European Journal of Combinatorics(1997)18, 211-229].

Related

• There exists no distance-regular graph with intersection array 56,36,9;1,3,48
• Distance-balanced closure of some graphs
• There exists no distance-regular graph with intersection array 55,36,11;1,4,45
• Bounding the parameter β of a distance-regular graph with classical parameters
• Distance-regular graphs with classical parameters that support a uniform structure: case q ≤ 1