✦ LIBER ✦

Distance-regular Graphs the Distance Matrix of which has Only One Positive Eigenvalue

✍ Scribed by J.H. Koolen; S.V. Shpectorov

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 244 KB
Volume: 15
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1994.1030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the distance matrix of a directed gra

On the distance matrix of a directed graph

✍ R. L. Graham; A. J. Hoffman; H. Hosoya 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _

On the Multiplicities of the Primitive I

On the Multiplicities of the Primitive Idempotents of a Q-Polynomial Distance-regular Graph

✍ Arlene A Pascasio 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 154 KB

and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let denote a distance-regular graph with diameter D ≥ 3. Suppose is Q-polynomial with respect to the ordering E 0 , E 1 , . . . , E D of