On a Koolen -- Park inequality and Terwilliger graphs

Details On a Koolen -- Park inequality and Terwilliger graphs On a Koolen -- Park inequality and Terwilliger graphs

2010-07-20

arxiv.org/abs/1007.3339v1

Mathematics

Combinatorics

Scientific paper

J.H. Koolen and J. Park have proved a lower bound for intersection number
$c_2$ of a distance-regular graph $\Gamma$. Moreover, they showed that the
graph $\Gamma$ which attains the equality 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$.

Affiliated with

Also associated with

No associations

Rating

On a Koolen -- Park inequality and Terwilliger graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a Koolen -- Park inequality and Terwilliger graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a Koolen -- Park inequality and Terwilliger graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125062