bn:00078132n
Noun Concept
Categories: Trees (graph theory), Articles with short description, Bipartite graphs, Trees (data structures)
EN
tree  tree diagram  tree structure  Child node  directed tree
EN
A figure that branches from a single root WordNet 3.0
English:
graph theory
graph
Definitions
Examples
Relations
Sources
EN
A figure that branches from a single root WordNet 3.0 & Open English WordNet
In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph. Wikipedia
A tree structure, tree diagram, or tree model is a way of representing the hierarchical nature of a structure in a graphical form. Wikipedia
A connected undirected graph without simple cycles Wikipedia Disambiguation
A connected graph without cycles Wikipedia Disambiguation
A way of representing the hierarchical nature of a structure in a graphical form Wikipedia Disambiguation
Undirected, connected and acyclic graph Wikidata
A connected graph with no cycles or, if the graph is finite, equivalently a connected graph with n vertices and n−1 edges. Wiktionary
EN
Genealogical tree WordNet 3.0 & Open English WordNet