✦ LIBER ✦

Leaves in Representation Diagrams of Bipartite Distance-Regular Graphs

✍ Scribed by Michael S. Lang

Book ID: 111587708
Publisher: Springer
Year: 2003
Tongue: English
Weight: 81 KB
Volume: 18
Category: Article
ISSN: 0925-9899
DOI: 10.1023/b:jaco.0000011939.15842.26

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Codes in Bipartite Distance-Regular Grap

Codes in Bipartite Distance-Regular Graphs

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

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

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

Bipartite distance-regular graphs of val

Bipartite distance-regular graphs of valency three

✍ Tatsuro Ito 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 788 KB

A characterization of bipartite distance

A characterization of bipartite distance-regular graphs

✍ Lee, Guang-Siang; Weng, Chih-wen 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 295 KB