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.
2017
2017
Given a connected graph $R$ on $r$ vertices and a rooted graph $H,$ let $R\{H\}$ be the graph obtained from $r$ copies of $H$ and… 
2015
2015
We consider in this paper a weighted consensus problem over directed graphs, where the agents interact in a decentralized way… 
2012
2012
SUMMARY Let G be a connected graph in which we designate a ver- tex or a block (a biconnected component) as the center of G . For… 
2011
2011
We pursue the problem of counting the imbeddings of a graph in each of the orientable surfaces. We demonstrate how to achieve… 
2010
2010
Our concern is deriving genus distributions of graphs ob- tained by surgical operations on graphs whose genus distribution is… 
2000
2000
Let (H, r) be a fixed rooted digraph. The (H, r)-coloring problem is the problem of deciding for which rooted digraphs (G, s… 
1993
1993
We examine some properties of the 2-variable greedoid polynomial f(G·,t,z) when G is the branching greedoid associated to a… 
1988
1988
LetG be a 2-connected rooted graph of rankr andA, B two (rooted) spanning trees ofG We show that the maximum number of exchanges… 
1980
1980
A concatenation of two vertex disjoint graphs is defined to be the graph obtained by identifying a vertex of one graph with a…