Category:Tree (graph theory)
Jump to navigation
Jump to search
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) 树 (图论)
undirected, connected and acyclic graph  | |||||
| Upload media | |||||
| Instance of |
| ||||
|---|---|---|---|---|---|
| Subclass of |
| ||||
| Named after | |||||
| Has use | |||||
| Different from | |||||
| Said to be the same as | free tree | ||||
| |||||
 | |||||
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 7 subcategories, out of 7 total.
Pages in category "Tree (graph theory)"
This category contains only the following page.
Media in category "Tree (graph theory)"
The following 81 files are in this category, out of 81 total.
-
0508maad.svg 111 × 125; 2 KB
-
0607zuhaerrod.svg 366 × 161; 9 KB
-
0608zuhamaila.svg 238 × 108; 6 KB
-
0609azpizuha.svg 165 × 114; 2 KB
-
0610altuera.svg 74 × 119; 2 KB
-
0611zuhaptar.svg 303 × 179; 4 KB
-
0612zuhaptaroso.svg 328 × 168; 5 KB
-
0613mustxa.svg 85 × 141; 2 KB
-
0614zuhaore.svg 96 × 74; 2 KB
-
0615zuhaezore.svg 100 × 88; 3 KB
-
0616althos.svg 96 × 74; 3 KB
-
0617althosko.svg 130 × 74; 3 KB
-
1-dimensional-range-query.svg 261 × 201; 21 KB
-
16 arbres etiquetes.png 371 × 289; 9 KB
-
1Trunk RSTs.png 470 × 282; 6 KB
-
1trunkStT.png 255 × 207; 2 KB
-
20 arbres plans etiquetes.png 530 × 286; 11 KB
-
5 arbres plans enracinés.png 306 × 140; 3 KB
-
ABBHOJA.jpg 219 × 183; 20 KB
-
ABBHOJA2.jpg 152 × 110; 21 KB
-
ArboreCorect.png 437 × 297; 7 KB
-
Arbre distance un.svg 450 × 350; 1 KB
-
ArbreDeMunn.png 571 × 565; 13 KB
-
Arbres plans.png 310 × 82; 3 KB
-
Automorphic equivalence.jpg 664 × 412; 47 KB
-
Balanced ternary tree graph center.svg 1,448 × 427; 16 KB
-
Bruhat-Tits-tree-for-Q-2.png 395 × 344; 39 KB
-
Caterpillar tree.svg 540 × 180; 2 KB
-
Cayley rooted-tree formula.svg 666 × 306; 10 KB
-
Cayley tree formula.svg 855 × 612; 12 KB
-
Cayley's formula 2-4.svg 312 × 386; 58 KB
-
Clique expr tree.png 545 × 807; 35 KB
-
CliqueRot.svg 1,162 × 684; 4 KB
-
Dictionary.png 720 × 405; 24 KB
-
-
-
Efficient and Secure Group Messaging Encryption (2020) - page 8.png 1,050 × 750; 27 KB
-
Efficient and Secure Group Messaging Encryption (2020) - page 9.png 1,050 × 750; 30 KB
-
Efnet-struc.png 843 × 965; 131 KB
-
EuroBaum.svg 946 × 598; 10 KB
-
Expression Tree.svg 524 × 372; 23 KB
-
Graphminimalgerst3hc.jpg 514 × 494; 18 KB
-
Induced-1.svg 225 × 162; 3 KB
-
Karyconversion.png 837 × 622; 117 KB
-
Karytoarray.png 1,010 × 827; 76 KB
-
Karytree.png 1,029 × 766; 62 KB
-
Kraskov tree.png 1,219 × 854; 39 KB
-
Logarithm visualization tree.svg 541 × 191; 12 KB
-
Lowest common ancestor.svg 156 × 415; 3 KB
-
Ltrotation.png 875 × 324; 11 KB
-
M-ary template generation.png 222 × 262; 4 KB
-
M-ary template generation2.png 182 × 258; 4 KB
-
M-ary template next.png 434 × 274; 6 KB
-
Net11.jpg 389 × 270; 21 KB
-
Parse-tree.svg 899 × 869; 17 KB
-
Pointermary.png 1,770 × 939; 63 KB
-
Principle variation 16bit.PNG 435 × 245; 3 KB
-
Rake-1.png 2,389 × 1,062; 84 KB
-
RB-Baum3.jpg 2,802 × 1,120; 381 KB
-
Regular equivalence.jpg 665 × 372; 41 KB
-
Rot-Schwarz-Baum.jpg 1,254 × 750; 176 KB
-
Skill Tree Wapenkunde.jpg 379 × 641; 29 KB
-
Stirling permutation Euler tour.svg 306 × 270; 2 KB
-
Structural Equivalence.jpg 503 × 310; 25 KB
-
Structural equivalence.jpg 306 × 215; 20 KB
-
Ternary tree 2.png 720 × 405; 19 KB
-
Tree with 480 symmetries.svg 512 × 151; 650 bytes
-
Tree with labels.svg 843 × 540; 22 KB
-
Tree-basis.jpg 668 × 715; 48 KB
-
TreeNetwork.svg 527 × 510; 3 KB
-
Two-tree Broadcast.svg 747 × 551; 19 KB
-
Two-tree reduce.svg 747 × 551; 18 KB
-
Two-tree reduction.svg 1,079 × 421; 29 KB
-
Two-trees.svg 1,010 × 682; 82 KB
-
Unlabeled ordered rooted trees of 4 edges and 2 leaves.svg 260 × 349; 5 KB
-
Wedderburn-Etherington trees.svg 864 × 468; 16 KB
-
WorstCaseLongestPathDecomposition.jpeg 668 × 637; 63 KB
-
Zag-zig.png 674 × 342; 24 KB
-
Zig e zag.png 610 × 244; 13 KB
-
Zig-zag2.png 644 × 324; 24 KB
-
Zig-zig e zag-zag.png 696 × 309; 25 KB
_-_illustration_-_page_5_figure_1.png)
_-_illustration_-_page_5_figure_2.png)
_-_page_8.png)
_-_page_9.png)
