On edge-regular graphs with b_1 = 5

Nonoriented v-vertex graph, in which degree of each vertex is equal k and each edge lies in \lambda triangles is called edge-regular graph with parameters (v,k,\lambda). Set b_1=k-\lambda-1. At the book "Distance-Regular Graphs" it is proved that connected graph with b_1=1 is polygon or complete multipartite graph K_{n\times 2}. Makhnev A. A. obtained the description of edge-regular graphs with b_1=3 and b_1=4, k\ge 10. In this paper it is classified connected edge-regular graphs with b_1=5 and either graph is strongly regular or k\ge 14.