A characterization of Q-polynomial distance-regular graphs using the intersection numbers
Abstract
We consider a primitive distance-regular graph with diameter at least 3. We use the intersection numbers of to find a positive semidefinite matrix G with integer entries. We show that G has determinant zero if and only if is Q-polynomial.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.