Distance-regular graphs with classical parameters that support a uniform structure: case q 2

Abstract

Let =(X,R) denote a finite, simple, connected, and undirected non-bipartite graph with vertex set X and edge set R. Fix a vertex x ∈ X, and define Rf = R \yz ∂(x,y) = ∂(x,z)\, where ∂ denotes the path-length distance in . Observe that the graph f=(X,Rf) is bipartite. We say that supports a uniform structure with respect to x whenever f has a uniform structure with respect to x in the sense of Miklavic and Terwilliger MikTer. Assume that is a distance-regular graph with classical parameters (D,q,α,β) and diameter D≥ 4. Recall that q is an integer such that q ∈ \-1,0\. The purpose of this paper is to study when supports a uniform structure with respect to x. We studied the case q 1 in FMMM, and so in this paper we assume q ≥ 2. Let T=T(x) denote the Terwilliger algebra of with respect to x. Under an additional assumption that every irreducible T-module with endpoint 1 is thin, we show that if supports a uniform structure with respect to x, then either α = 0 or α=q, β=q2(qD-1)/(q-1), and D 0 6.

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…