✦ LIBER ✦

A characterization of bipartite distance-regular graphs

✍ Scribed by Lee, Guang-Siang; Weng, Chih-wen

Book ID: 122276888
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 295 KB
Volume: 446
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2013.12.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tails of Bipartite Distance-regular Grap

Tails of Bipartite Distance-regular Graphs

✍ Michael S. Lang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let denote a bipartite distance-regular graph with diameter D ≥ 4 and valency k ≥ 3. Let θ 0 > θ 1 > • • • > θ D denote the eigenvalues of and let E 0 , E 1 , . . . , E D denote the associated primitive idempotents. Fix s (1 ≤ s ≤ D -1) and abbreviate E := E s . We say E is a tail whenever the entry

Bipartite Distance-regular Graphs, Part

Bipartite Distance-regular Graphs, Part I

✍ Brian Curtin 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 144 KB

Bipartite Distance-regular Graphs, Part

Bipartite Distance-regular Graphs, Part II

✍ Brian Curtin 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 137 KB

Codes in Bipartite Distance-Regular Grap

Codes in Bipartite Distance-Regular Graphs

✍ Bannai, E. 📂 Article 📅 1977 🏛 Oxford University Press 🌐 English ⚖ 171 KB

The diameter of bipartite distance-regul

The diameter of bipartite distance-regular graphs

✍ Paul Terwilliger 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 272 KB

Intersection numbers of bipartite distan

Intersection numbers of bipartite distance-regular graphs

✍ John S Caughman IV 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 219 KB