Characterization of the Folded Johnson Graphs of Small Diameter by their Intersection Arrays

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.