---
tag: TVHSJ65MXG
kind: concept
name: Distance-regular graph
aliases: [distance-regular-graphs, intersection-array]
sources:
  - wikipedia: en:7768943@r1326563603
    locator: Distance-regular graph
    note: adopted
    mention: wikipedia://en/7768943
    sections: [Summary]
same_as:
  wikidata: Q3115556
  wikipedia: Distance-regular graph
inventory: [5N8CXHPBF3]
---

## Summary

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