e/Rooted graph

New Query

Information
has glosseng: 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.
lexicalizationeng: rooted graph
instance ofc/Extensions and generalizations of graphs

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint