Strongly regular graphs

Strongly regular graphs are a special class of graphs characterized by their regularity and specific connection properties between vertices. A graph \( G \) is called strongly regular with parameters \( (n, k, \lambda, \mu) \) if it satisfies the following conditions: 1. **Regularity**: The graph has \( n \) vertices, and each vertex has degree \( k \) (i.e., it is \( k \)-regular).