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.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
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.
has abstract
In der Graphentheorie ist ein ...... nderen Wurzelgraphen isomorph.
@de
In mathematics, and, in partic ...... eachable from the root vertex.
@en
В теории графов корневым графо ...... корневого произведения графов.
@ru
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,920,942
Link from a Wikipage to another Wikipage
title
Rooted Graph
@en
urlname
RootedGraph
@en
wikiPageUsesTemplate
hypernym
type
comment
In der Graphentheorie ist ein ...... nderen Wurzelgraphen isomorph.
@de
In mathematics, and, in partic ...... eachable from the root vertex.
@en
В теории графов корневым графо ...... корневого произведения графов.
@ru
label
Rooted graph
@en
Wurzelgraph
@de
Корневой граф
@ru