On strongly regular graphs with b(1) < 24

被引：0

作者：

Nirova, M. S. ^{[1
]}

机构：

[1] Russian Acad Sci, Ural Branch, Inst Math & Mech, Moscow, Russia

来源：

TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN | 2012年 / 18卷 / 03期

关键词：

strongly regular graph; partial geometry; pseudo geometric graph;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let be a connected edge-regular graph with parameters (v, k, lambda), and let b(1) - k - lambda - 1. It is well-known that, if b(1) = 1, then Gamma is either a polygon or a complete multipartite graph with parts of order 2. Graphs with b(1) <= 4 were classified earlier. The investigation of graphs even in the case b(1) = 5 involves great difficulties. However, for strongly regular graphs, the situation is much simpler. In this paper, we classify strongly regular graphs with b(1) < 24.

引用

页码：187 / 194

页数：8

共 8 条

[1] Brouwer A.E, 2011, HOMEPAGE TABLE PARAM
[2] Brouwer A.E., 1989, DISTANCE REGULAR GRA
[3] A (49, 16, 3, 6) STRONGLY REGULAR GRAPH DOES NOT EXIST
BUSSEMAKER, FC
HAEMERS, WH
MATHON, R
WILBRINK, HA
[J]. EUROPEAN JOURNAL OF COMBINATORICS, 1989, 10 (05) : 413 - 418
[4] [Казарина Вероника Игоревна Kazarina V.I.], 2009, [Владикавказский математический журнал, Vladikavkazskii matematicheskii zhurnal], V11, P29
[5] On the strong regularity of some edge-regular graphs
Makhnev, AA
[J]. IZVESTIYA MATHEMATICS, 2004, 68 (01) : 159 - 180
[6] MAKHNEV AA, 1997, VOPROSY ALGEBRY, P60
[7] MAKHNEV AA, 1996, DISKRET ANAL ISSLED, V3, P71
[8] Wilbrink H.A., 1983, P KON NEDERL AKAD A, V45, P117

← 1 →