Geodesic
A distance-regular graph with strongly closed subgraphs
Journal of Algebraic Combinatorics, Tome 14 (2001) no. 2, pp. 127-131.

Voir la notice de l'article provenant de la source Electronic Library of Mathematics

Summary: Let $Gamma$ be a distance-regular graph of diameter $d$, valency $k$ and $r$ := max $i | ( c _{i}, b _{i}) = ( c _{1}, b _{1})$. Let $q$ be an integer with $r + 1leqled - 1$. In this paper we prove the following results:
Keywords: distance-regular graph, strongly closed subgraph 
@article{JAC_2001__14_2_a3,
     author = {Hiraki, Akira},
     title = {A distance-regular graph with strongly closed subgraphs},
     journal = {Journal of Algebraic Combinatorics},
     pages = {127--131},
     publisher = {mathdoc},
     volume = {14},
     number = {2},
     year = {2001},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JAC_2001__14_2_a3/}
}
TY  - JOUR
AU  - Hiraki, Akira
TI  - A distance-regular graph with strongly closed subgraphs
JO  - Journal of Algebraic Combinatorics
PY  - 2001
SP  - 127
EP  - 131
VL  - 14
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JAC_2001__14_2_a3/
LA  - en
ID  - JAC_2001__14_2_a3
ER  - 
%0 Journal Article
%A Hiraki, Akira
%T A distance-regular graph with strongly closed subgraphs
%J Journal of Algebraic Combinatorics
%D 2001
%P 127-131
%V 14
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JAC_2001__14_2_a3/
%G en
%F JAC_2001__14_2_a3
Hiraki, Akira. A distance-regular graph with strongly closed subgraphs. Journal of Algebraic Combinatorics, Tome 14 (2001) no. 2, pp. 127-131. http://geodesic.mathdoc.fr/item/JAC_2001__14_2_a3/