On distance-regular graphs with height two. II (Q1383815)

[For Part I see ibid. 5, No. 1, 57-76 (1996; Zbl 0843.05104).] Let \(\Gamma\) be a distance-regular graph with diameter \(d\geq 3\). Let \(h=\max \{i\mid p_{d,i}^d\neq 0\}\) be the height of \(\Gamma\). A graph \(\Gamma\) is of height \(0\) if and only if \(\Gamma\) is an antipodal 2-cover, and is of height \(1\) if and only if \(\Gamma_d(a)\) is a nontrivial clique for every \(a\in \Gamma\). So if the height of \(\Gamma\) is \(1\), \(\Gamma\) is the distance-2 graph of a generalized odd graph. The next question is what kind of distance-regular graphs are of height \(2\). Theorem 1.2. Let \(\Gamma\) be a distance-regular graph with diameter \(d\geq 3\) and height 2. Suppose that for every \(a\in \Gamma\) and every \(b\in \Gamma_d(a)\), the intersection \(\Gamma_d(a)\cap \Gamma_2(b)\) is isomorphic to a complete multipartite graph \(K_{t\times 2}\) with \(t\geq 2\). Then \(d=4\) and \(\Gamma\) is isomorphic to the Johnson graph \(J(10,4)\).