Distance-regular graphs with classical parameters that support a uniform structure: case $q \ge 2$
Abstract
Let denote a finite, simple, connected, and undirected non-bipartite graph with vertex set and edge set . Fix a vertex , and define , where denotes the path-length distance in . Observe that the graph is bipartite. We say that supports a uniform structure with respect to whenever has a uniform structure with respect to in the sense of Miklavi\v{c} and Terwilliger \cite{MikTer}. Assume that is a distance-regular graph with classical parameters and diameter . Recall that is an integer such that . The purpose of this paper is to study when supports a uniform structure with respect to . We studied the case in \cite{FMMM}, and so in this paper we assume . Let denote the Terwilliger algebra of with respect to . Under an additional assumption that every irreducible -module with endpoint is thin, we show that if supports a uniform structure with respect to , then either or , , and .
Cite
@article{arxiv.2308.16679,
title = {Distance-regular graphs with classical parameters that support a uniform structure: case $q \ge 2$},
author = {Blas Fernández and Roghayeh Maleki and Štefko Miklavič and Giusy Monzillo},
journal= {arXiv preprint arXiv:2308.16679},
year = {2023}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2305.08937