共 50 条
On strongly regular graphs with b1 < 24
被引:0
|作者:
M. S. Nirova
机构:
[1] Ural Branch of the Russian Academy of Sciences,Institute of Mathematics and Mechanics
来源:
Proceedings of the Steklov Institute of Mathematics
|
2013年
/
283卷
关键词:
strongly regular graph;
partial geometry;
pseudogeometric graph;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
Let γ be a connected edge-regular graph with parameters (v, k, λ), and let b1 = k−λ−1. It is well known that, if b1 = 1, then Γ is either a polygon or a complete multipartite graph with parts of order 2. Graphs with b1 ≤ 4 were classified earlier. The investigation of graphs even in the case b1 = 5 involves great difficulties. However, for strongly regular graphs, the situation is much simpler. In this paper, we classify strongly regular graphs with b1 < 24.
引用
收藏
页码:111 / 118
页数:7
相关论文