On a Koolen -- Park inequality and Terwilliger graphs
Gavrilyuk, Alexander
Original · EN
J.H. Koolen and J. Park have proved a lower bound for intersection number c₂ of a distance-regular graph Γ. Moreover, they showed that the graph Γ which attains the equality in this bound is a Terwilliger graph. We prove that Γ is the icosahedron, the Doro graph or the Conway-Smith graph, if equality is attained and c₂≥ 2.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.