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

Related topics

Related topics

20 relations
Binary decision diagramCall graphCompilerComputer science
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Distributed evaluation and convergence of self-appraisals in social networks
We consider in this paper a networked system of opinion dynamics in continuous time, where the agents are able to evaluate their… Expand
  • figure 1
Is this relevant?
2012
2012
Classification of some countable descendant-homogeneous digraphs
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
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in… Expand
  • figure 1
  • figure 2
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… Expand
  • figure 1
  • figure 2
Is this relevant?
2007
2007
Regular rooted graph grammars: a web type and schema language
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
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… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2001
2001
A characteristic polynomial for rooted graphs and rooted digraphs
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
Is this relevant?
2001
2001
Self-stabilizing PIF algorithm in arbitrary rooted networks
We present a deterministic distributed Propagation of Information with Feedback (PIF) protocol in arbitrary rooted networks. The… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1978
Highly Cited
1978
A new graph product and its spectrum
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
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE