Rooted graph
In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root. Both directed and undirected versions of rooted graphs have been studied, and there are also variant definitions that allow multiple roots.
Rooted graphs may also be known (depending on their application) as pointed graphs or flow graphs. In some of the applications of these graphs, there is an additional requirement that the whole graph be reachable from the root vertex.
Q395
mathematics
Concept
Q131476
graph theory
Concept
Q141488
graph
Concept
Q1304193
vertex
Concept
Q1137726
directed
Concept
Q141488
undirected
Concept
Q1361526
reachable
Concept
Q7366593
Rooted graph
Concept
studies
subclass of
part of
part of
studies
part of