𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An equitable partition for a distance-regular graph of negative type

✍ Scribed by Štefko Miklavič

Book ID
108167381
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
164 KB
Volume
95
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classical Distance-Regular Graphs of Neg
Classical Distance-Regular Graphs of Negative Type
✍ Chih-wen Weng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 160 KB

We prove the following theorem. Theorem. Let 1=(X, R) denote a distance-regular graph with classical parameters (d, b, :, ;) and d 4. Suppose b<&1, and suppose the intersection numbers a 1 {0, c 2 >1. Then precisely one of the following (i) (iii) holds. (i) 1 is the dual polar graph 2 A 2d&1 (&b).

The Terwilliger algebra of a distance-re
The Terwilliger algebra of a distance-regular graph of negative type
✍ Štefko Miklavič 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Let denote a distance-regular graph with diameter D 3. Assume has classical parameters (D, b, α, β) with b < -1. Let X denote the vertex set of and let A ∈ Mat X (C) denote the adjacency matrix of . Fix x ∈ X and let A \* ∈ Mat X (C) denote the corresponding dual adjacency matrix. Let T denote the s