There does not exist a distance-regular graph with intersection array
arXiv:1809.10029
Abstract
In this paper we will show that there does not exist a distance-regular graph with intersection array . We first show that a local graph of does not contain a coclique with 5 vertices, and then we prove that the graph is geometric by showing that consists of 4 disjoint cliques with 20 vertices. Then we apply a result of Koolen and Bang to the graph , and we could obtain that there is no such a distance-regular graph.
15 pages