Trees (graph theory)

undirected, connected and acyclic graph

mathematical sequence

node-link graph in which one central node is the only neighbor of all the other nodes

measure of the branching complexity of a mathematical tree or a river system

class of problems in combinatorial mathematics

tree diagram used to find and analyze potential moves in a game

result in graph theory

graph with nodes connected linearly

mapping of a graph into a tree

well-quasi-ordering of finite trees

term in computer science

thumb|The Goldner–Harary graph, an example of a planar 3-tree. In graph theory, a '''k-tree' is an undirected graph formed by starting with a (k + 1)-vertex complete graph and then repeatedly adding vertices in such a way that each added vertex v has exactly k neighbors U such that, together, the k + 1 vertices formed by v and U'' form a clique.

regular infinite tree structure used in statistical mechanics

sequence of numbers counting certain kinds of binary trees

thumb|A polytree In mathematics, and more specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose underlying undirected graph is a tree. In other words, a polytree is formed by assigning an orientation to each edge of a connected and acyclic undirected graph.

tree in which all the vertices are within distance 1 of a central path

thumb|upright=1.35|Branch decomposition of a grid graph, showing an e-separation. The separation, the decomposition, and the graph all have width three. In graph theory, a branch-decomposition of an undirected graph G is a hierarchical clustering of the edges of G, represented by an unrooted binary tree T with the edges of G as its leaves. Removing any edge from T partitions the edges of G into two subgraphs, and the width of the decomposition is the maximum number of shared vertices of any pair of subgraphs formed in this way. The branchwidth of G is the minimum width of any branch-decomposi

tree data structure in which each node has at most k children

sequence of moves in a game

connected graph whose biconnected components are all cliques