Tree (graph theory)
In graph theory, a tree is an undirected graph in which any two vertices are 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. The term "tree" was coined in 1857 by the British mathematician Arthur Cayley.
- ChromaticNumber
- 2
- Comment
- enIn graph theory, a tree is an undirected graph in which any two vertices are 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. The term "tree" was coined in 1857 by the British mathematician Arthur Cayley.
- Depiction
- Edges
- env − 1
- Has abstract
- enIn graph theory, a tree is an undirected graph in which any two vertices are 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. A polytree (or directed tree or oriented tree or singly connected network) is a directed acyclic graph (DAG) whose underlying undirected graph is a tree. A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirected graph is a forest. The various kinds of data structures referred to as trees in computer science have underlying graphs that are trees in graph theory, although such data structures are generally rooted trees. A rooted tree may be directed, called a directed rooted tree, either making all its edges point away from the root—in which case it is called an arborescence or out-tree—or making all its edges point towards the root—in which case it is called an anti-arborescence or in-tree. A rooted tree itself has been defined by some authors as a directed graph. A rooted forest is a disjoint union of rooted trees. A rooted forest may be directed, called a directed rooted forest, either making all its edges point away from the root in each rooted tree—in which case it is called a branching or out-forest—or making all its edges point towards the root in each rooted tree—in which case it is called an anti-branching or in-forest. The term "tree" was coined in 1857 by the British mathematician Arthur Cayley.
- Hypernym
- Graph
- Id
- enp/t094060
- ImageCaption
- enA labeled tree with 6 vertices and 5 edges.
- Is primary topic of
- Tree (graph theory)
- Label
- enTree (graph theory)
- Link from a Wikipage to an external page
- www.ijcai.org/Proceedings/83-1/Papers/041.pdf
- projecteuclid.org/euclid.acta/1485889061
- books.google.com/books%3Fid=vaXv_yhefG8C
- webhome.cs.uvic.ca/~ruskey/Theses/GangLiMScThesis.pdf
- web.archive.org/web/20190517165158/http:/www.edutechlearners.com/download/Graphtheory.pdf
- www.edutechlearners.com/download/Graphtheory.pdf
- diestel-graph-theory.com/index.html
- cseweb.ucsd.edu/~dasgupta/papers/poly.pdf
- Link from a Wikipage to another Wikipage
- Acta Mathematica
- Arborescence (graph theory)
- Arthur Cayley
- AVL tree
- Binary tree
- Bipartite graph
- Breadth-first search
- Building (mathematics)
- Category:Bipartite graphs
- Category:Trees (graph theory)
- Caterpillar tree
- Cayley's formula
- Cayley graph
- Complete graph
- Computer science
- Connected component (graph theory)
- Connected graph
- Connectivity (graph theory)
- Countable set
- Cycle (graph theory)
- Data structures
- Decision tree
- Degeneracy (graph theory)
- Degree (graph theory)
- Depth-first search
- Directed acyclic graph
- Disjoint union of graphs
- Edge (graph theory)
- File:Tree graph.svg
- Free group
- Glossary of graph theory
- Graph center
- Graph isomorphism
- Graph theory
- Hypertree
- K-ary tree
- List of graphs
- Matrix tree theorem
- Median graph
- Minor (graph theory)
- Multinomial theorem
- Multitree
- N-connected
- Normal tree
- OEIS
- Order-zero graph
- Partial ordering
- Path (graph theory)
- Path graph
- Planar graph
- Polytree
- Prüfer sequence
- Pseudoforest
- Recursive tree
- Sharp-P-complete
- Spanning tree
- Spanning tree (mathematics)
- Star (graph theory)
- Star graph
- Starlike tree
- Subgraph (graph theory)
- Ternary tree
- Tree (data structure)
- Tree data structure
- Tree structure
- Trémaux tree
- Uncountable set
- Underlying graph
- Undirected graph
- Unrooted binary tree
- Up to
- Vertex (graph theory)
- Name
- enTrees
- Ref
- ennone
- SameAs
- 2Ycng
- 4004849-4
- Alber (matematega)
- Albero (grafo)
- Arbo (grafeteorio)
- Árbol (teoría de grafos)
- Arbore (teoria grafurilor)
- Arbre (teoria de grafs)
- Arbre (théorie des graphes)
- Árvore (grafo)
- Baum (Graphentheorie)
- Cây (lý thuyết đồ thị)
- Drevo (teorija grafov)
- Drzewo (matematyka)
- Fa (gráfelmélet)
- m.0c 7g
- Medis (grafų teorija)
- Pohon (teori graf)
- Puu (graafiteooria)
- Puu (graafiteoria)
- Q272735
- Stablo (teorija grafova)
- Strom (graf)
- Strom (teória grafov)
- Träd (graf)
- Tree (graph theory)
- Δέντρο (Θεωρία Γράφων)
- Дерево (теория графов)
- Дерево (теорія графів)
- Дърво (математика)
- Йывăç (графсен теорийĕ)
- Стабло (теорија графова)
- עץ (תורת הגרפים)
- درخت (نظریه گراف)
- درخت (نظریہ گراف)
- شجرة (نظرية المخططات)
- மரம் (கோட்டுருவியல்)
- ต้นไม้ (ทฤษฎีกราฟ)
- 木 (数学)
- 树 (图论)
- 나무 그래프
- Subject
- Category:Bipartite graphs
- Category:Trees (graph theory)
- Thumbnail
- Title
- enTree
- Vertices
- env
- WasDerivedFrom
- Tree (graph theory)?oldid=1124521821&ns=0
- WikiPageLength
- 25145
- Wikipage page ID
- 48560
- Wikipage revision ID
- 1124521821
- WikiPageUsesTemplate
- Template:Anchor
- Template:Authority control
- Template:Citation
- Template:Commons category
- Template:Harv
- Template:Harvtxt
- Template:Infobox graph
- Template:Main
- Template:Math
- Template:Mvar
- Template:OEIS
- Template:OEIS link
- Template:Reflist
- Template:Sfn
- Template:Sfnp
- Template:Short description
- Template:Springer
- Template:Sub
- Template:Sup
- Template:Who
