Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03652549n
Noun Concept
Categories: Algebraic graph theory, Graph families, Regular graphs
EN
distance-regular graph  distance-regular graphs  distance regular graph  intersection array
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
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 Wikidata
IS A
regular graph
HAS KIND
strongly regular graph
hypercube graph
distance-transitive graph
Hamming graph
halved cube graph
HAS INSTANCE
Shrikhande graph
Tutte–Coxeter graph
Desargues graph
Biggs–Smith graph
Tutte 12-cage
+13 relations
STUDIED BY
graph theory
Wikipedia
EN
distance-regular graph
Wikidata
EN
distance-regular graph
Wikipedia Redirections
EN
distance-regular graphs, distance regular graph, intersection array

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License