Distance-regular graph
Summary
In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices and , the number of vertices at distance from and at distance from depends only upon , , and the distance between and .
Further reading
- Wikipedia, page 7768943, revision 1326563603, Distance-regular graph. adopted
About this page
| Tag | TVHSJ65MXG |
|---|---|
| URI | m2://TVHSJ65MXG |
| Aliases | distance-regular-graphs, intersection-array |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.