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.

2018

M -Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on Z…

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…

2017

In this thesis, I propose a new technique of Aligning English sentence words with its Semantic Representation using Inductive…

2016

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

2014

A graphG in which a vertex is distinguished from other vertices is called a rooted graph and the vertex is called the root ofG…

2012

Implementing a graph programming system is not a straightforward task. The challenge not only lies in converting a graphical…

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…

1980

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