Recognition: unknown
Terwilliger algebra of Odd graphs
classification
🧮 math.CO
keywords
algebraterwilligergraphjohnsonbasiscomputeddeterminediscrete
read the original 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\leq n$. The distance-$m$ graph of $J(2m+1,m)$ is the Odd graph $O_{m+1}$. In this paper, we determine the Terwilliger algebra of $O_{m+1}$ and give its basis.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.