Characterization of the odd graphs Ok by
✍
Aeryung Moon
📂
Article
📅
1982
🏛
Elsevier Science
🌐
English
⚖ 776 KB
In this note, we settle a problem of N. Biggs [4, p. 801 by showing that for each k, no distance regular graph non-isomorphic to the odd graph Ok can have the same parameters as Ok. A related charxterization of certain graphs associated with the Johnson scheme J(2& + 1, k) is also g&en. By a graph w