In graph theory, a strongly regular graph is a regular graph G = with v vertices and degree k such that for some given integers λ, μ ≥ 0 {\displaystyle \lambda,\mu \geq 0} every two adjacent vertices have λ common neighbours, and every two non-adjacent vertices have μ common neighbours. Wikipedia