 Strongly regular graph

A strongly regular graph has constant degree and fixed common-neighbour counts for adjacent and nonadjacent vertex pairs.

A strongly regular graph is a specific type of graph characterized by a regular structure that satisfies certain conditions regarding its vertices and edges. Formally, a strongly regular graph \( G \) is defined by three parameters \( (n, k, \lambda, \mu) \) where: - \( n \) is the total number of vertices in the graph.