Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 222,184,658 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
20 relations
Binary decision diagram
Call graph
Compiler
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
$A_{\alpha}$-spectrum of a graph obtained by copies of a rooted graph and applications
O. Rojo
2017
Corpus ID: 119593366
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…
Expand
2015
2015
Consensus with linear objective maps
Xudong Chen
,
M. Belabbas
,
T. Başar
IEEE Conference on Decision and Control
2015
Corpus ID: 17853126
We consider in this paper a weighted consensus problem over directed graphs, where the agents interact in a decentralized way…
Expand
2012
2012
Indexing All Rooted Subgraphs of a Rooted Graph
Tomoki Imada
,
H. Nagamochi
IEICE Trans. Inf. Syst.
2012
Corpus ID: 44795815
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…
Expand
2011
2011
Genus distribution of graph amalgamations: self-pasting at root-vertices
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…
Expand
2010
2010
Genus distribution of graphs under surgery: adding edges and splitting vertices
J. Gross
2010
Corpus ID: 2791816
Our concern is deriving genus distributions of graphs ob- tained by surgical operations on graphs whose genus distribution is…
Expand
2007
2007
Inferring Class Composition Structures in Semistructured Data
Dong-Yal Seo
,
Jeon-Young Lee
2007
Corpus ID: 17511708
2000
2000
Homomorphism duality for rooted oriented paths
Petra Smol okov
2000
Corpus ID: 10546473
Let (H, r) be a fixed rooted digraph. The (H, r)-coloring problem is the problem of deciding for which rooted digraphs (G, s…
Expand
1993
1993
On the greedoid polynomial for rooted graphs and rooted digraphs
Elizabeth W. McMahon
Journal of Graph Theory
1993
Corpus ID: 22304818
We examine some properties of the 2-variable greedoid polynomial f(G·,t,z) when G is the branching greedoid associated to a…
Expand
1988
1988
Branchings in rooted graphs and the diameter of greedoids
G. Ziegler
Comb.
1988
Corpus ID: 33284095
LetG be a 2-connected rooted graph of rankr andA, B two (rooted) spanning trees ofG We show that the maximum number of exchanges…
Expand
1980
1980
Reconstruction of a Pair of Graphs from their Concatenations
S. Kundu
,
E. Sampathkumar
,
J. Shearer
,
Dean G. Sturtevant
SIAM J. Algebraic Discret. Methods
1980
Corpus ID: 18150663
A concatenation of two vertex disjoint graphs is defined to be the graph obtained by identifying a vertex of one graph with a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE