✦ LIBER ✦

BipartiteQ-Polynomial Distance-Regular Graphs

✍ Scribed by John S. Caughman IV

Publisher: Springer Japan
Year: 2004
Tongue: English
Weight: 319 KB
Volume: 20
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-003-0538-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dual Bipartite Q-polynomial Distance-reg

Dual Bipartite Q-polynomial Distance-regular Graphs

✍ Garth A. Dickie; Paul M. Terwilliger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Twice Q-polynomial distance-regular grap

Twice Q-polynomial distance-regular graphs are thin

✍ Garth A Dickie 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Bipartite Q-Polynomial Quotients of Anti

Bipartite Q-Polynomial Quotients of Antipodal Distance-Regular Graphs

✍ John S. Caughman IV 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Let 1 denote a bipartite Q-polynomial distance-regular graph with diameter D 4. We show that 1 is the quotient of an antipodal distance-regular graph if and only if one of the following holds. (i) 1 is a cycle of even length. (ii) 1 is the quotient of the 2D-cube. 1999 Academic Press \* , ..., %\

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-regular Graphs withbi=cd−iand T

Distance-regular Graphs withbi=cd−iand Two P-polynomial Structures

✍ Tomoya Koishi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Let be a distance-regular graph with b i = c d-i for all 1 ≤ i ≤ r. We show that if the diameter d ≤ 3r + 2 and a d = 0, then k d = a d + 1 and has two P-polynomial structures.

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