Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,895,808 papers from all fields of science
Search
Sign In
Create Free Account
Rooted graph
Known as:
Accessible pointed graph
, Rooted digraph
, Rooted directed 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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Binary decision diagram
Call graph
Compiler
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
One-ended spanning trees in amenable unimodular graphs
Ádám Timár
Electronic Communications in Probability
2018
Corpus ID: 54889099
We prove that every amenable one-ended Cayley graph has an invariant spanning tree of one end. More generally, for any 1-ended…
Expand
2015
2015
Distributed evaluation and convergence of self-appraisals in social networks
Xudong Chen
,
Ji Liu
,
M. Belabbas
,
Zhi Xu
,
T. Başar
IEEE Conference on Decision and Control
2015
Corpus ID: 5980357
We consider in this paper a networked system of opinion dynamics in continuous time, where the agents are able to evaluate their…
Expand
2011
2011
Genus distribution of graph amalgamations: self-pasting at root-vertices
J. Gross
The Australasian Journal of Combinatorics
2011
Corpus ID: 7118892
We pursue the problem of counting the imbeddings of a graph in each of the orientable surfaces. We demonstrate how to achieve…
Expand
2011
2011
A novel approach to coordination of multiple robots with communication failures via proximity graph
Yuan Fan
,
G. Feng
,
Yong Wang
,
Jianbin Qiu
at - Automatisierungstechnik
2011
Corpus ID: 45729491
Highly Cited
2000
Highly Cited
2000
Recurrence of Distributional Limits of Finite Planar Graphs
I. Benjamini
,
O. Schramm
2000
Corpus ID: 2862151
Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is…
Expand
1998
1998
Polymorphic Type Analysis in Logic Programs by Abstract Intepretation
L. Lu
The Journal of Logic Programming
1998
Corpus ID: 15948544
1993
1993
The cordiality of one-point union of n copies of a graph
S. Shee
,
Y. Ho
Discrete Mathematics
1993
Corpus ID: 20197611
Highly Cited
1990
Highly Cited
1990
On the Regular Structure of Prefix Rewriting
D. Caucal
Theoretical Computer Science
1990
Corpus ID: 18883307
Highly Cited
1990
Highly Cited
1990
Threshold functions for extension statements
J. Spencer
Journal of combinatorial theory. Series A
1990
Corpus ID: 23546674
Highly Cited
1985
Highly Cited
1985
Depth-First Search is Inherently Sequential
J. Reif
Information Processing Letters
1985
Corpus ID: 8308276
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE