Certain graphs with exactly one irreducible $T$-module with endpoint $1$, which is thin: the pseudo-distance-regularized case
Combinatorics
2023-01-25 v1
Abstract
Let denote a finite, simple and connected graph. Fix a vertex of which is not a leaf and let denote the Terwilliger algebra of with respect to . Assume that the unique irreducible -module with endpoint is thin, or equivalently that is pseudo-distance-regular around . We consider the property that has, up to isomorphism, a unique irreducible -module with endpoint , and that this -module is thin. The main result of the paper is a combinatorial characterization of this property.
Keywords
Cite
@article{arxiv.2301.10143,
title = {Certain graphs with exactly one irreducible $T$-module with endpoint $1$, which is thin: the pseudo-distance-regularized case},
author = {Blas Fernández},
journal= {arXiv preprint arXiv:2301.10143},
year = {2023}
}