# Distance-regular graph

## Graph property / From Wikipedia, the free encyclopedia

#### Dear Wikiwand AI, let's keep it short by simply answering these key questions:

Can you list the top facts and stats about Distance-regular graph?

Summarize this article for a 10 years old

SHOW ALL QUESTIONS

In the mathematical field of graph theory, a **distance-regular graph** is a regular graph such that for any two vertices v and w, the number of vertices at distance j from v and at distance k from w depends only upon j, k, and the distance between v and w.

**Quick facts: Graph families defined by their automorphisms...**▼

Graph families defined by their automorphisms | ||||
---|---|---|---|---|

distance-transitive | → | distance-regular | ← | strongly regular |

↓ | ||||

symmetric (arc-transitive) | ← | t-transitive, t ≥ 2 |
skew-symmetric | |

↓ | ||||

_{(if connected)}vertex- and edge-transitive |
→ | edge-transitive and regular | → | edge-transitive |

↓ | ↓ | ↓ | ||

vertex-transitive | → | regular | → | _{(if bipartite)}biregular |

↑ | ||||

Cayley graph | ← | zero-symmetric | asymmetric |

Some authors exclude the complete graphs and disconnected graphs from this definition.

Every distance-transitive graph is distance-regular. Indeed, distance-regular graphs were introduced as a combinatorial generalization of distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group.