On Q-polynomial distance-regular graphs with a linear dependency involving a 3-clique
Abstract
Let denote a distance-regular graph with diameter D ≥ 2. Let E denote a primitive idempotent of with respect to which is Q-polynomial. Assume that there exists a 3-clique \x,y,z\ such that Ex,Ey,Ez are linearly dependent. In this paper, we classify all the Q-polynomial distance-regular graphs with the above property. We describe these graphs from multiple points of view.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.