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â€¦Â (More)

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

2012

2012

- Detlef Plump, Christopher Bak
- ECEASST
- 2012

We present an approach for programming with graph transformation rules in which programs can be as efficient as programs inâ€¦Â (More)

Is this relevant?

2012

2012

- Huang Lin Chao, Ye Xudong
- Proceedings of the 31st Chinese Controlâ€¦
- 2012

A lower bound for the second smallest eigenvalue (SSE) of the unweighted Laplacian for an N-vertex directed rooted graph isâ€¦Â (More)

Is this relevant?

2010

2010

- Bingbing Zhuang, Hiroshi Nagamochi
- CIAC
- 2010

In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by aâ€¦Â (More)

Is this relevant?

2008

2008

- David D Eisenstat, Gary Gordon, Amanda Redlich
- SIAM J. Discrete Math.
- 2008

For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independentâ€¦Â (More)

Is this relevant?

2008

2008

- Sacha Berger
- 2008

This thesis investigates a pragmatic approach to typing, static analysis and static optimization of Web query languages, inâ€¦Â (More)

Is this relevant?

2006

2006

- Steve Grikschat, Jose A. Costa, Alfred O. Hero, Olivier J. J. Michel
- 2006 IEEE International Conference on Acousticsâ€¦
- 2006

We introduce a new similarity measure between data points suited for clustering and classification on smooth manifolds. Theâ€¦Â (More)

Is this relevant?

2003

2003

- Alison Bailey, Gary Gordon, Matthew Patton, Jennifer Scancella
- Discrete Applied Mathematics
- 2003

When G is a rooted graph where each edge may independently succeed with probability p, we consider the expected number ofâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

Suppose that Gj is a sequence of finite connected planar graphs, and in each Gj a special vertex, called the root, is chosenâ€¦Â (More)

Is this relevant?

2001

2001

- Gary Gordon, Elizabeth W. McMahon
- Discrete Mathematics
- 2001

We consider the one-variable characteristic polynomial p(G; ) in two settings. When G is a rooted digraph, we show that thisâ€¦Â (More)

Is this relevant?

1993

1993

- Elizabeth W. McMahon
- Journal of Graph Theory
- 1993

We examine some properties of the 2-variable greedoid polynomial f(G;t, z) when G is the branching greedoid associated to aâ€¦Â (More)

Is this relevant?