Terwilliger algebra of Odd graphs

Abstract

In [The Terwilliger algebra of the Johnson schemes, Discrete Mathematics 307 (2007) 1621--1635], Levstein and Maldonado computed the Terwilliger algebra of the Johnson scheme J(n,m) when 3m≤ n. The distance-m graph of J(2m+1,m) is the Odd graph Om+1. In this paper, we determine the Terwilliger algebra of Om+1 and give its basis.

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…