Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
For finite q, we classify the countable, descendant-homogeneous digraphs in which the descendant set of any vertex is a q-valent… Expand
  • figure 1
2011
2011
  • J. Gross
  • Australas. J Comb.
  • 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
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • table 2.1
2008
2008
For a rooted graph $G$, let $EV(G;p)$ be the expected number of vertices reachable from the root when each edge has an… Expand
  • figure 1
  • figure 2
Highly Cited
2008
Highly Cited
2008
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in… Expand
  • figure 1
  • figure 2
2007
2007
This thesis investigates a pragmatic approach to typing, static analysis and static optimization of Web query languages, in… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
2003
2003
When G is a rooted graph where each edge may independently succeed with probability p, we consider the expected number of… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
2001
2001
Abstract We consider the one-variable characteristic polynomial p ( G ; λ ) in two settings. When G is a rooted digraph, we show… Expand
  • figure 1
  • figure 2
  • table 1
Highly Cited
2001
Highly Cited
2001
The basic querying mechanism over semistructured data, namely regular path queries, asks for all pairs of objects that are… Expand
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… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.2
Highly Cited
1978
Highly Cited
1978
A new graph product i s introduced, and t h e c h a r a c t e r i s t i c polynomial of a graph so-formed i s given a s a… Expand
  • figure 2
  • figure 3