Title of article
Characterization of the Folded Johnson Graphs of Small Diameter by their Intersection Arrays
Author/Authors
Metsch، نويسنده , , Klaus، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
13
From page
901
To page
913
Abstract
It is known that the folded Johnson graphs J(2m,m) withm ≥ 16 are uniquely determined as distance regular graphs by their intersection array. We show that the same holds form ≥ 6.
Journal title
European Journal of Combinatorics
Serial Year
1997
Journal title
European Journal of Combinatorics
Record number
1550494
Link To Document