✦ LIBER ✦

Tight Distance-Regular Graphs

✍ Scribed by Aleksandar Jurišić; Jack Koolen; Paul Terwilliger

Book ID: 111564651
Publisher: Springer
Year: 2000
Tongue: English
Weight: 388 KB
Volume: 12
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1026544111089

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Distance-regular Graphs and the Su

Tight Distance-regular Graphs and the Subconstituent Algebra

✍ Junie T. Go; Paul Terwilliger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Tight Distance-Regular Graphs and the Q-

Tight Distance-Regular Graphs and the Q-Polynomial Property

✍ Arlene A. Pascasio 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 179 KB

Distance degree regular graphs

✍ Teluhiko Hilano; Kazumasa Nomura 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 175 KB

Two distance-regular graphs

✍ Andries E. Brouwer, Dmitrii V. Pasechnik 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 321 KB

Edge-distance-regular graphs

✍ M. Cámara; C. Dalfó; J. Fàbrega; M.A. Fiol; E. Garriga 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 189 KB

From regular boundary graphs to antipoda

From regular boundary graphs to antipodal distance-regular graphs

✍ Fiol, M. A.; Garriga, E.; Yebra, J. L. A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

Let Γ be a regular graph with n vertices, diameter D, and d + 1 In a previous paper, the authors showed that if P (λ) > n -1, then D ≤ d -1, where P is the polynomial of degree d-1 which takes alternating values ±1 at λ 1 , . . . , λ d . The graphs satisfying P (λ) = n -1, called boundary graphs, h