Category:Trees (structure)
From Wikipedia, the free encyclopedia
In graph theory, a tree is a graph in which any two points, or vertices, are connected by exactly one path (i.e. there are no cycles). A forest is a graph in which any two vertices are connected by at most one path. An equivalent definition is that a forest is graph of one or more (unconnected) trees (hence the name). Trees are useful abstract structural representations of many different concepts.
Subcategories
There are 3 subcategories to this category shown below (more may be shown on subsequent pages).
H
S
T
Pages in category "Trees (structure)"
There are 106 pages in this section of this category.
