Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00521890n
Noun Concept
Categories: Trees (graph theory), Directed acyclic graphs
EN
arborescence  rooted tree  Arboreal decomposition  branching  directed rooted tree
EN
In graph theory, an arborescence is a directed graph in which, for a vertex u and any other vertex v, there is exactly one directed path from u to v. Wikipedia
English:
graph theory
Definitions
Relations
Sources
EN
In graph theory, an arborescence is a directed graph in which, for a vertex u and any other vertex v, there is exactly one directed path from u to v. Wikipedia
Rooted tree with edges oriented out of the root node Wikidata
IS A
tree
arborescence
rooted graph
polytree
HAS PART
tree
root node
HAS KIND
arborescence
anti-arborescence
k-ary tree
binary tree
ordered tree
OPPOSITE OF
anti-arborescence
free tree
STUDIED BY
graph theory
Wikipedia
EN
arborescence (graph theory)
Wikidata
EN
arborescence, rooted tree
Wikipedia Redirections
EN
Arboreal decomposition
Wikidata Alias
EN
branching, directed rooted tree, oriented tree, out-arborescence, out-tree, rooted tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License