There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\) (Q2287750)

The introduction of the paper is presented as review because it describes given work here very precisely. ``In this paper, we will show that there does not exists a distance-regular graph \(\Gamma \) with intersection array \(\left\{ 8,\ 54,\ 12;1,\ 6,\ 60\right\}\). In order to do so, we will first study the claw-bound that was introduced by Bose in the case of pseudo geometric strongly regular graphs [\textit{R. C. Bose}, Pac. J. Math. 13, 389--419 (1963; Zbl 0118.33903)]. We note that a similar bound for amply-regular graphs with an \(s\)-claw was shown by \textit{C. D. Godsil} [N. Z. J. Math. 22, No. 2, 31--38 (1993; Zbl 0793.05146)] and that \textit{J. H. Koolen} and \textit{J. Park} [Eur. J. Comb. 31, No. 8, 2064--2073 (2010; Zbl 1221.05117)] also studied the claw-bound for distance-regular graphs and they mentioned that three known examples of Terwilliger graphs with \(c_{2}\geq 2\) meet equality in the claw-bound. After that, \textit{A. L. Gavrilyuk} [Electron. J. Comb. 17, No. 1, Research Paper R125, 8 p. (2010; Zbl 1277.05173)] showed that if an amply-regular Terwilliger graph with \(c\geq 2\) attains equality in the claw-bound, then the graph is one of the known Terwillinger graphs. Next, we will show that for a given vertex \(x\) of \(\Gamma ,\) the subgraph \(\Delta\) induced on the neighbors of \(x\) does not contain a coclique of size 5. From the claw-bound, it is easy to see that \(\Delta\) does not contain a coclique of size 6. One may think that non-existence of coclique of size 5 follows from the result of Gavrilyuk [loc. cit., Theorem 4.2], but it is not true because his result works if for any non-adjacent two distinct vertices in \(\Delta,\) there exists a coclique of size 5 containing them. So, we need to give a proof to show that \(\Delta\) does not contain a coclique of size 5 without using the result of Gavrilyuk . Also, we remark that Gavrilyuk [loc. cit., Theorem 4.2] missed to state that the graph is Terwilliger. Finally, we will show that \(\Delta\) consists of 4 disjoint cliques of size 20. This shows that the graph \(\Gamma\) is geometric and then a result by \textit{J. H. Koolen} and \textit{S. Bang} [J. Comb. Theory, Ser. B 100, No. 6, 573--584 (2010; Zbl 1203.05043)] finishes the proof.''