In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers every two adjacent vertices have λ common neighbours, and every two non-adjacent vertices have μ common neighbours.