Category:Tree (graph theory)

 The article Tree (graph theory) on Wikipedia projects: (en) Tree (graph theory) ·
(bg) Дърво (математика) · (cs) Strom (graf) · (de) Baum (Graphentheorie) · (el) Δέντρο (Θεωρία Γράφων) · (eo) Arbo (grafeteorio) · (es) Árbol (teoría de grafos) · (fa) درخت (نظریه گراف) · (fi) Puu (graafiteoria) · (fr) Arbre (graphe) · (he) עץ (תורת הגרפים) · (hu) Fa (gráfelmélet) · (it) Albero (grafo) · (ja) 木 (数学) · (ko) 트리 · (lt) Medis (grafų teorija) · (nl) Boomstructuur · (pl) Drzewo (matematyka) · (pt) Árvore (grafo) · (ro) Arbore (teoria grafurilor) · (ru) Дерево (теория графов) · (sk) Strom (graf) · (sl) Drevo (teorija grafov) · (sr) Стабло (теорија графова) · (sv) Träd (graf) · (th) ต้นไม้ (ทฤษฎีกราฟ) · (uk) Дерево (теорія графів) · (ur) درخت (نظریہ مخطط) · (vi) Cây (lý thuyết đồ thị) · (zh) 树 (图论) · +/−

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 5 subcategories, out of 5 total.

N

P

S

T

Media in category "Tree (graph theory)"

Last modified on 6 April 2014, at 23:14