arXiv Analytics

Sign in

arXiv:2407.00714 [math.CO]AbstractReferencesReviewsResources

On $Q$-Polynomial distance-regular graphs with a linear dependency involving a $3$-clique

Mojtaba Jazaeri

Published 2024-06-30Version 1

Let $\Gamma$ denote a distance-regular graph with diameter $D \geq 2$. Let $E$ denote a primitive idempotent of $\Gamma$ with respect to which $\Gamma$ is $Q$-polynomial. Assume that there exists a $3$-clique $x,y,z$ such that $E\hat{x},E\hat{y},E\hat{z}$ are linearly dependent. In this paper, we classify all the $Q$-polynomial distance-regular graphs $\Gamma$ with the above property. We describe these graphs from multiple points of view.

Related articles: Most relevant | Search more
arXiv:1011.2000 [math.CO] (Published 2010-11-09)
Vertex subsets with minimal width and dual width in $Q$-polynomial distance-regular graphs
arXiv:1405.2546 [math.CO] (Published 2014-05-11)
Twice $Q$-polynomial distance-regular graphs of diameter 4
arXiv:1706.03132 [math.CO] (Published 2017-06-09)
A characterization of $Q$-polynomial distance-regular graphs using the intersection numbers