Geodesic
On the Koolen-Park inequality and Terwilliger graphs
The electronic journal of combinatorics, Tome 17 (2010)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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$.
DOI : 10.37236/397
Classification : 05E30, 05C12 
@article{10_37236_397,
     author = {Alexander L. Gavrilyuk},
     title = {On the {Koolen-Park} inequality and {Terwilliger} graphs},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/397},
     zbl = {1277.05173},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/397/}
}
TY  - JOUR
AU  - Alexander L. Gavrilyuk
TI  - On the Koolen-Park inequality and Terwilliger graphs
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/397/
DO  - 10.37236/397
ID  - 10_37236_397
ER  - 
%0 Journal Article
%A Alexander L. Gavrilyuk
%T On the Koolen-Park inequality and Terwilliger graphs
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/397/
%R 10.37236/397
%F 10_37236_397
Alexander L. Gavrilyuk. On the Koolen-Park inequality and Terwilliger graphs. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/397

Cité par Sources :