Distance-regular graphs with exactly one positive q-distance eigenvalue
Abstract
In this paper, we study the q-distance matrix for a distance-regular graph and show that the q-distance matrix of a distance-regular graph with classical parameters (D, q, α, β) has exactly three distinct eigenvalues, of which one is zero. Moreover, we study distance-regular graphs whose q-distance matrix has exactly one positive eigenvalue.
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.