Distance-regular graph
id:
distance-regular-graph-199-2927925
title:
Distance-regular graph
text:
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. 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 g
brand slug:
wiki
category slug:
encyclopedia
description:
Graph property
original url:
https://en.wikipedia.org/wiki/Distance-regular_graph
date created:
date modified:
2023-12-07T01:51:28Z
main entity:
{"identifier":"Q3115556","url":"https://www.wikidata.org/entity/Q3115556"}
image:
fields total:
13
integrity:
14