Image: Wikimedia Commons

tree

Undirected, connected and acyclic graph

Entityclass of graphs with few cliques mathematical concept hereditary graph classQ272735

Also known as tree graph

Instance of: class of graphs with few cliques
, mathematical concept
, hereditary graph class
Subclass of: connected graph
, forest
, pseudotree
+4 more

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

In graph theory, a tree is an undirected graph in which every pair of distinct vertices is connected by exactly one path, or equivalently, a connected acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by at most one path, or equivalently an acyclic undirected graph, or equivalently a disjoint union of trees.

Overview

All data

49 statements · 12% with external sources · numbers in brackets are citations

Different from: Baum criterion used: descriptive page and disambiguation page have to be in different items · applies to name of subject: Baum
Named after: tree
Has use: tree structure
Derivative work: tree
dendrogram
tree structure
Does not have part: cycle
Has characteristic: edge-connectivity criterion used: simple graph · upper limit: 1
vertex-connectivity criterion used: simple graph · upper limit: 1
chromatic number numeric value: 2
Studied by: graph theory
Opposite of: cyclic graph
Said to be the same as: free tree

On other databases

23 identifiers linking tree across the web's reference databases

Data quality

statements

12%

externally sourced

Source last edited September 6, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q272735

API docs, limits & keys

Cite this page

AIDB. (2026). tree (Q272735). Retrieved from https://aidb.si/e/tree-Q272735