Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
  • Á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… 
2015
2015
We consider in this paper a networked system of opinion dynamics in continuous time, where the agents are able to evaluate their… 
2011
2011
  • 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… 
Highly Cited
2000
Highly Cited
2000
Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is… 
1998
1998
  • L. Lu
  • The Journal of Logic Programming
  • 1998
  • Corpus ID: 15948544
1993
1993
Highly Cited
1990
Highly Cited
1990
  • D. Caucal
  • Theoretical Computer Science
  • 1990
  • Corpus ID: 18883307
Highly Cited
1990
Highly Cited
1990
  • J. Spencer
  • Journal of combinatorial theory. Series A
  • 1990
  • Corpus ID: 23546674
Highly Cited
1985
Highly Cited
1985
  • J. Reif
  • Information Processing Letters
  • 1985
  • Corpus ID: 8308276