A note on triangle-free distance-regular graphs with a2 ≠ 0

Yeh jong Pan*, Chih-wen Weng

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 ≠ 0. We show that the intersection number c2 is either 1 or 2, and if c2 = 1, then (b, α, β) = (- 2, - 2, ((- 2)D + 1 - 1) / 3).

Original languageEnglish
Pages (from-to)266-270
Number of pages5
JournalJournal of Combinatorial Theory. Series B
Volume99
Issue number1
DOIs
StatePublished - 1 Jan 2009

Keywords

  • Classical parameters
  • Distance-regular graphs

Fingerprint Dive into the research topics of 'A note on triangle-free distance-regular graphs with a<sub>2</sub> ≠ 0'. Together they form a unique fingerprint.

Cite this