In
graph theory, a
strongly regular graph is defined as follows. Let
G = (
V,
E) be a
regular graph with
v vertices and degree
k.
G is said to be
strongly regular if there are also
integers λ and μ such that:
- Every two adjacent vertices have λ common neighbours.
- Every two non-adjacent vertices have μ common neighbours.