On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays (Q5961463)

The main result of this paper is the characterization of the folded Johnson graphs \(\overline J(2m,m)\) and the folded halved \(2m\)-cubes by their intersection array in the case, when the diameter \(d\) of the graph is greater than or equal to 8. Earlier this result was obtained in the case \(d\geq 154\). Let \(\Gamma\) be a distance regular graph with intersection array of the folded Johnson graphs \(\overline J(2m,m)\) or of the folded halved \(2m\)-cubes. The first result is a bound for the minimal eigenvalue \(\Theta\) of the adjacency matrix of \(\Gamma(x)\), \(x\in\Gamma:\Theta\geq-2-2/(m-3)\). The proof of the main result is a step by step precisement of a structure of \(\Gamma(x)\). In lemma 2.9 it is proved that \(\Gamma\) is locally without 3-claws. In this place, the result of \textit{M. Numata} [A characterization of Grassmann and Johnson graphs, J. Comb. Theory, Ser. B 48, No. 2, 178-190 (1990; Zbl 0743.05067)] may be used.