| Information | |
|---|---|
| has gloss | eng: In mathematics, and, in particular, in graph theory, a rooted graph is a mathematical graph in which one node is labelled in a special way to distinguish it from the graph's other nodes. This special node is called the root of the graph. |
| lexicalization | eng: rooted graph |
| instance of | c/Extensions and generalizations of graphs |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint