Distance-regular graph
= Distance-regular graph
{wiki=Distance-regular_graph}
A distance-regular graph is a specific type of graph that has a high degree of regularity in the distances between pairs of vertices. Formally, a graph \\( G \\) is said to be distance-regular if it satisfies the following conditions: 1. **Regularity**: The graph is \\( k \\)-regular, meaning each vertex has exactly \\( k \\) neighbors.