Geodesic
Amply Regular Graphs with $b_1=6$
Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 2 (2009) no. 1, pp. 63-77

Voir la notice de l'article provenant de la source Math-Net.Ru

The unnoriented graph with $v$ verteces of valency $k$, such that every edge belongs to $\lambda$ triangles, is called an edge regular graph with the parameters $(v,k,\lambda)$. Let $b_1=k-\lambda-1$. In [1] it is proved that a connected edge regular graph with $b_1=1$ is either a polygon or a complete multipart graph all of whose parts have order 2. Edge regular graphs with $b_1\le5$ have been studied in previous work. In the present paper we investigate amply regular graphs with $b_1=6$.
Keywords: amply regular graph, unoriented graph. 
@article{JSFU_2009_2_1_a5,
     author = {Konstantin S. Efimov and Alexander A. Makhnev},
     title = {Amply {Regular} {Graphs} with $b_1=6$},
     journal = {\v{Z}urnal Sibirskogo federalʹnogo universiteta. Matematika i fizika},
     pages = {63--77},
     publisher = {mathdoc},
     volume = {2},
     number = {1},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a5/}
}
TY  - JOUR
AU  - Konstantin S. Efimov
AU  - Alexander A. Makhnev
TI  - Amply Regular Graphs with $b_1=6$
JO  - Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
PY  - 2009
SP  - 63
EP  - 77
VL  - 2
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a5/
LA  - ru
ID  - JSFU_2009_2_1_a5
ER  - 
%0 Journal Article
%A Konstantin S. Efimov
%A Alexander A. Makhnev
%T Amply Regular Graphs with $b_1=6$
%J Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika
%D 2009
%P 63-77
%V 2
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a5/
%G ru
%F JSFU_2009_2_1_a5
Konstantin S. Efimov; Alexander A. Makhnev. Amply Regular Graphs with $b_1=6$. Žurnal Sibirskogo federalʹnogo universiteta. Matematika i fizika, Tome 2 (2009) no. 1, pp. 63-77. http://geodesic.mathdoc.fr/item/JSFU_2009_2_1_a5/