Open main menu
tree 
undirected, connected and acyclic graph
Neveu.png
Upload media
Wikipedia-logo-v2.svg  Wikipedia
Subclass of graph,
planar graph,
block graph,
squaregraph
Named after
Different from
Authority control
Blue pencil.svg
árbol (es); Fa (hu); arbre (ca); Baum (de); Alber (matematega) (lmo); Стабло (sr-ec); 树 (zh); træ (da); arbore (ro); 木 (ja); Träd (sv); עץ (he); 樹 (zh-hant); 树 (zh-cn); 트리 (ko); arbo (eo); strom (cs); albero (it); arbre (fr); Puu (graafiteooria) (et); 树 (zh-hans); درخت (ur); дерево (ru); Stablo (sr-el); Medis (lt); koks (lv); Strom (sk); стабло (sr); Drevo (sl); Cây (vi); 樹 (zh-hk); 树 (zh-sg); ต้นไม้ (th); Drzewo (pl); árvore (pt); boom (nl); 樹 (zh-tw); puu (fi); дерево (uk); درخت (fa); tree (en); شجرة (ar); Δέντρο (el); Дърво (bg) grafo non orientato, connesso e aciclico (it); グラフ理論の用語 (ja); gráfelméleti szakkifejezés (hu); niet-gerichte samenhangende cycelvrije graaf (nl); terme en teoria de grafs (ca); graf aciclic, conex, neorientat (ro); 無向連通無環圖 (zh-tw); связный ациклический граф (ru); 無向連通無環圖 (zh-hant); Graph, mit dem sich eine Monohierarchie modellieren lässt (de); grafo en el que cualesquiera dos vértices están conectados por exactamente un camino (es); undirected, connected and acyclic graph (en); sencikla grafo (eo); neorientovaný souvislý graf bez kružnic (cs); graf (da) albero non ordinato, albero ordinato (it); дерево-граф, дерево (граф), граф-дерево, ациклический граф (ru); Azyklisch zusammenhängender Graph, Baumstruktur (de); Cây nhị phân, Rừng (vi); 樹 (zh); Стабло (sr); Gozd (sl); 樹状構造, 樹形図, 樹状図, ツリー (ja); Stromový graf (sk); גרף עץ, עץ מכוון (he); ทรี, กราฟต้นไม้ (th); Skog (sv); Tree (graph theory (ur); 포레스트, 수형도 (ko); Arbol, Bosque (es); Gepatro, Arbo-ordo, Radikhava arbo, Nereduktebla arbo, Direktita arbo, Folio, Infano, Serio-malpligrandigita arbo, Arba ordo, Senradika arbo, Arbaro, Orda arbo (eo); Дървовидна структура (bg); Aprėpties medis, Miškas (lt)

A tree in mathematics and graph theory is an undirected graph in which any two vertices are connected by exactly one simple path. In other words, any connected graph without simple cycles is a tree. A forest is a disjoint union of trees.

Subcategories

This category has the following 6 subcategories, out of 6 total.

N

P

S

T

Pages in category "Tree (graph theory)"

This category contains only the following page.

Media in category "Tree (graph theory)"

The following 35 files are in this category, out of 35 total.