Dual Bipartite $Q$-Polynomial Distance-Regular Graphs and Dual Uniform Structures
Abstract
Let $\Gamma$ denote a dual bipartite $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D \geq 3$. Fix $x \in X$, and let $L^*$ and $R^*$ denote the corresponding dual lowering and dual raising matrix, respectively. We show that a certain linear dependency among $R^* L^{* 2}, L^* R^* L^*, L^{* 2} R^*, L^*$ holds, and determine whether this linear dependency endow $\Gamma$ with a dual uniform or dual strongly uniform structure. Precisely, except for two special cases a dual uniform structure is always attained, and except for four special cases a dual strongly uniform structure is always attained.
Published
2024-11-01
How to Cite
Monzillo, G. (2024). Dual Bipartite $Q$-Polynomial Distance-Regular Graphs and Dual Uniform Structures. The Electronic Journal of Combinatorics, 31(4), P4.32. https://doi.org/10.37236/13054
Article Number
P4.32