In mathematics, and, in particular, in graph theory, a rooted graph is a graph in which one vertex has been distinguished as the root.[1][2] Both directed and undirected versions of rooted graphs have been studied, and there are also variant definitions that allow multiple roots.
Rooted graphs may also be known (depending on their application) as pointed graphs or flow graphs. In some of the applications of these graphs, there is an additional requirement that the whole graph be reachable from the root vertex.
^Zwillinger, Daniel (2011), CRC Standard Mathematical Tables and Formulae, 32nd Edition, CRC Press, p. 150, ISBN 978-1-4398-3550-0
^Harary, Frank (1955), "The number of linear, directed, rooted, and connected graphs", Transactions of the American Mathematical Society, 78 (2): 445–463, doi:10.1090/S0002-9947-1955-0068198-2, MR 0068198. See p. 454.
in graph theory, a rootedgraph is a graph in which one vertex has been distinguished as the root. Both directed and undirected versions of rooted graphs...
In mathematical graph theory, the rooted product of a graph G and a rootedgraph H is defined as follows: take |V(G)| copies of H, and for every vertex...
weighted directed graphs where two nodes are distinguished, a source and a sink. Rooted directed graphs (also known as flow graphs) are digraphs in which...
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
associative operation (for unlabelled graphs), zig-zag graph product; graph product based on other products: rootedgraph product: it is an associative operation...
Flow graph may refer to: Flow or rootedgraph (graph theory), a graph in which a vertex has been distinguished as the root Control-flow graph (computer...
root of the rooted tree, etc. The notion of "graph isomorphism" allows us to distinguish graph properties inherent to the structures of graphs themselves...
graph edit distances between suitably constrained graphs. Likewise, graph edit distance is also a generalization of tree edit distance between rooted...
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)...
In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by complementation...
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional...
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...
undirected, rather than directed graph, in which case a binary tree is an ordered, rooted tree. Some authors use rooted binary tree instead of binary tree...
Does a Moore graph with girth 5 and degree 57 exist? (more unsolved problems in mathematics) In graph theory, a Moore graph is a regular graph whose girth...
stalks. The last possible set of graphs that can be made are convergent ones, also known as arbitrarily rootedgraphs. By using the fusion principle, we...
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 G. In general, a graph may...
strictly speaking a tree, but rather a more general graph, or a directed acyclic graph in the case of rooted networks. They are used to overcome some of the...
1987 by Rebane and Pearl. An arborescence is a directed rooted tree, i.e. a directed acyclic graph in which there exists a single source node that has a...
odd values of n counts Perfect matchings of the complete graph Kn + 1 for odd n. In such a graph, any single vertex v has n possible choices of vertex that...
Global Information