Root
Summary
A designated vertex in a graph, particularly in directed trees and rooted graphs.
The inverse operation to a graph power: a th root of a graph is another graph on the same vertex set such that two vertices are adjacent in if and only if they have distance at most in the root.
Further reading
- Wikipedia, page 325802, revision 1373839425, Glossary of graph theory, section R. adopted
About this page
| Tag | JR8XWH71HT |
|---|---|
| URI | m2://JR8XWH71HT |
| Kind | concept |
| Writing | W1 stated |
| 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.