RUS  ENG
Full version
JOURNALS // Journal of Siberian Federal University. Mathematics & Physics // Archive

J. Sib. Fed. Univ. Math. Phys., 2009 Volume 2, Issue 1, Pages 63–77 (Mi jsfu52)

This article is cited in 2 papers

Amply Regular Graphs with $b_1=6$

Konstantin S. Efimov, Alexander A. Makhnev

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences

Abstract: 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.

UDC: 519.17

Received: 10.09.2008
Received in revised form: 15.12.2008
Accepted: 15.01.2009



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025