FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2017
02419702017

Related topics

Related topics

20 relations
Binary decision diagramCall graphCompilerComputer science
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Rooted graph
Structured programming
Compiler
Computer science
Vertex
Edge contraction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Rooted Graph Programs
We present an approach for programming with graph transformation rules in which programs can be as efficient as programs in… (More)
  • figure 1
  • figure 3
Is this relevant?
2012
2012
Lower bound for the second smallest eigenvalue of directed rooted graph Laplacian
A lower bound for the second smallest eigenvalue (SSE) of the unweighted Laplacian for an N-vertex directed rooted graph is… (More)
  • figure 2
  • figure 1
Is this relevant?
2010
2010
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Combinatorial Properties of a Rooted Graph Polynomial
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
Regular Rooted Graph Grammars
This thesis investigates a pragmatic approach to typing, static analysis and static optimization of Web query languages, in… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
2006
2006
Dual Rooted-Diffusions for Clustering and Classification on Manifolds
We introduce a new similarity measure between data points suited for clustering and classification on smooth manifolds. The… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2003
2003
Expected Value Expansions in Rooted Graphs
When G is a rooted graph where each edge may independently succeed with probability p, we consider the expected number of… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Recurrence of Distributional Limits of Finite Planar Graphs
Suppose that Gj is a sequence of finite connected planar graphs, and in each Gj a special vertex, called the root, is chosen… (More)
  • figure 2.1
  • figure 3.1
  • figure 3.2
Is this relevant?
2001
2001
A characteristic polynomial for rooted graphs and rooted digraphs
We consider the one-variable characteristic polynomial p(G; ) in two settings. When G is a rooted digraph, we show that this… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
1993
1993
On the greedoid polynomial for rooted graphs and rooted digraphs
We examine some properties of the 2-variable greedoid polynomial f(G;t, z) when G is the branching greedoid associated to a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?