Category:Tree (graph theory)

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
árbol (es); 樹狀圖 (yue); fa (hu); дерево (ru); Baum (de); Alber (matematega) (lmo); pemë (sq); Стабло (sr-ec); Дърво (bg); træ (da); arbore (ro); 木 (ja); träd (sv); עץ (he); 樹 (zh-hant); 树 (zh-cn); 트리 (ko); arbo (eo); strom (cs); மரம் (கோட்டுருவியல்) (ta); albero (it); arbre (fr); 树 (zh-hans); Stablo (teorija grafova) (hr); Puu (graafiteooria) (et); дрэва (be-tarask); 树 (zh); Strom (sk); Cây (vi); 樹 (zh-hk); Stablo (sr-el); árvore (pt); koks (lv); 樹 (zh-tw); стабло (sr); Drevo (sl); puu (fi); drzewo (pl); 树 (zh-sg); pohon (id); tre (nn); ต้นไม้ (th); boom (nl); дерево (uk); درخت (fa); Medis (lt); درخت (ur); tree (en); شجرة (ar); Δέντρο (el); arbre (ca) grafo non orientato, connesso e aciclico (it); irányítatlan, összefüggő, körmentes gráf (hu); неарыентаваны, зьвязны ацыклічны граф (be-tarask); terme en teoria de grafs (ca); Graph, mit dem sich eine Monohierarchie modellieren lässt (de); grafik i drejtuar, i lidhur dhe aciklik (sq); graf (da); graf aciclic, conex, neorientat (ro); グラフ理論の用語 (ja); graf yang tak berarah, terhubung, dan asiklik (id); niet-gerichte samenhangende cycelvrije graaf (nl); 無向連通無環圖 (zh-hant); 無向連通無環圖 (zh-tw); grafo en el que cualesquiera dos vértices están conectados por exactamente un camino (es); graafi (fi); undirected, connected and acyclic graph (en); sencikla grafo (eo); neorientovaný souvislý graf bez kružnic (cs); связный ациклический граф (ru) albero non ordinato, albero ordinato (it); fagráf (hu); дрэва-граф (be-tarask); дерево-граф, дерево (граф), граф-дерево (ru); Baumstruktur, azyklisch zusammenhängender Graph (de); Cây nhị phân, Rừng (vi); degë (sq); 樹 (zh); Стабло (sr); Gozd (sl); 樹状構造, 樹形図, 樹状図, ツリー (ja); Stromový graf (sk); גרף עץ, עץ מכוון (he); ทรี, กราฟต้นไม้ (th); Skog (sv); arbol (es); 포레스트, 수형도 (ko); Дървовидна структура (bg); Gepatro, Arbo-ordo, Radikhava arbo, Nereduktebla arbo, Direktita arbo, Folio, Infano, Serio-malpligrandigita arbo, Arba ordo, Senradika arbo, Arbaro, Orda arbo (eo); Tree (graph theory (ur); Aprėpties medis, Miškas (lt)
tree 
undirected, connected and acyclic graph
Neveu.png
Upload media
Wikipedia-logo-v2.svg  Wikipedia
Subclass ofplanar graph,
block graph,
squaregraph,
simple graph,
connected graph,
forest,
acyclic graph
Named after
Use
Different from
Authority control
Edit infobox data on Wikidata

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 37 files are in this category, out of 37 total.