Strongly regular graph

A Strongly Regular Graph is a special type of graph where each point (called a vertex) is connected to a certain number of other vertices and the same number of edges come from each vertex. Additionally, if two vertices are connected, then their common neighbors (vertices that are connected to both of them) will always be the same number. For example, if vertex A is connected to vertex B and vertex B is connected to vertex C, then vertex A and C will be connected to the same number of other vertices. Put simply, a Strongly Regular Graph is a special type of graph where the same number of edges and common neighbors always shows up.