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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

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…

2014

In this article, we study so‐called rooted packings of rooted graphs. This concept is a mutual generalization of the concepts of…

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…

2010

In this paper, we consider an arbitrary class ${\cal H}$ of rooted graphs such that each biconnected component is given by a…

2008

In dieser Arbeit wir ein pragmatischer Ansatz zur Typisierung, statischen Analyse und Optimierung von Web-Anfragespachen…

2007

2005

We define an algorithm $k$ which takes a connected graph $G$ on a totally ordered vertex set and returns an increasing tree $R…

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…

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

A concatenation of two vertex disjoint graphs is defined to be the graph obtained by identifying a vertex of one graph with a…