go-v.orgdoi

On the Koolen–Park inequality and Terwilliger graphs

Alexander L. Gavrilyuk · The Electronic Journal of Combinatorics · 2010

  • DOI 10.37236/397
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2010

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2010

Abstract

J.H. Koolen and J. Park proved a lower bound for the intersection number $c_2$ of a distance-regular graph $\Gamma$. Moreover, they showed that a graph $\Gamma$, for which equality is attained in this bound, is a Terwilliger graph. We prove that $\Gamma$ is the icosahedron, the Doro graph or the Conway–Smith graph if equality is attained and $c_2\ge 2$.

Open the resolved locator · 10.37236/397

Metadata licence: OpenAlex metadata (CC0)