Live briefing
Everything about Tree (graph theory)
Undirected, connected, and acyclic graph
In graph theory, a tree is an undirected graph in which every pair of distinct vertices is 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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Tree (graph theory)A 5-minute orientation
- Skim a recent paper: Rooted Product and Restricted Rooted Product of Soft Directed GraphsInfluential work since 2022
- Pick up a classic book: Algebra 2The most-reprinted book on the subject
- Read the landmark paper: Packing rooted directed cuts in a weighted directed graphCited 82 times
- Go sideways: Glossary of graph theoryA closely related topic
- Go sideways: Directed graphA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Packing rooted directed cuts in a weighted directed graph
Ricci–Ollivier curvature of the rooted phylogenetic subtree–prune–regraft graph
Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications
Counting rooted spanning forests for circulant foliation over a graph
THE SIMILARITY OF METRIC DIMENSION AND LOCAL METRIC DIMENSION OF ROOTED PRODUCT GRAPH
Inverse spectral problems for differential operators on a graph with a rooted cycle
On the greedoid polynomial for rooted graphs and rooted digraphs
A characteristic polynomial for rooted graphs and rooted digraphs
🆕 Influential since 2022
Rooted Product and Restricted Rooted Product of Soft Directed Graphs
Almost unimodal and real-rooted graph polynomials
Graph domination in rooted products: equitable and outdegree equitable approaches
The average expected value of a rooted graph, Monte Carlo calculation, and a power index for the voting game
Rooted Clusters for Graph LP Algebras
đź“š Books worth reading
Algebra 2McGraw-Hill · 1998- 📕Quiver Representations and Quiver VarietiesAlexander Kirillov · 2016
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…
- Directed graph In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed…
- Rooted graph In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root. Both directed and…
- Spanning tree In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of…
- Graph (discrete mathematics) In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some…
- Polytree In mathematics, and more specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed…
- Directed acyclic graph In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it…
- Cycle (graph theory) In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a…