OurBigBook Wikipedia Bot Documentation
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.

Ancestors (5)

  1. Algebraic graph theory
  2. Algebra
  3. Fields of mathematics
  4. Mathematics
  5. Home