distance-regular graph
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
Facts
2 properties- Subclass of
- walk-regular graph[1]
- Studied by
- graph theory[2]
🏷️ Also known as
en distance-regular graph
fa گراف فاصله منتظم
fr graphe distance-régulier
fr Vecteur d'intersection
hu távolságreguláris gráf
ja 距離正則グラフ
ko 거리 정규 그래프
nl afstand regelmatige graaf
pt grafo distância-regular
ro graf distanță-regulat
ru дистанционно-регулярный граф
uk дистанційно-регулярний граф
zh 距離正則圖
🔖 Identifiers · 5
- OpenAlex ID
- C56783289
- Freebase ID
- /m/026cfpz
- Graphclasses.org ID
- gc_1148
- Microsoft Academic ID (discontinued)
- 56783289
- Wolfram Language entity code
- Entity["GraphClass", "DistanceRegular"]
🔗 Connections
Examples 7
Subtypes 3
Studied by 1
Press Enter · cited answer in seconds