On strongly regular graphs with b1 < 24

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