Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On $Q$-polynomial distance-regular graphs with a linear dependency involving a $3$-clique (2407.00714v3)

Published 30 Jun 2024 in math.CO

Abstract: 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.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com