In graph theory, a quotient graph Q of a graph G is a graph whose vertices are blocks of a partition of the vertices of G and where block B is… (More)

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

2016

2016

We study how the number c(X) of components of a graph X can be expressed through the number and properties of the components of a… (More)

Is this relevant?

2013

2013

- Jon Williamson
- J. Applied Logic
- 2013

Inductive logic admits a variety of semantics (Haenni et al., 2011, Part 1). This paper develops semantics based on the norms of… (More)

Is this relevant?

2007

2007

- Zaiping Lu, Sanming Zhou
- Journal of Graph Theory
- 2007

Let be a finite G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B. It was observed that the quotient… (More)

Is this relevant?

2005

2005

- Mohammad A. Iranmanesh, Cheryl E. Praeger, Sanming Zhou
- J. Comb. Theory, Ser. B
- 2005

This paper forms part of a study of 2-arc transitivity for finite imprimitive symmetric graphs, namely for graphs admitting an… (More)

Is this relevant?

2004

2004

- Carlo Bellettini, Lorenzo Capra
- The IEEE Computer Society's 12th Annual…
- 2004

Most analysis techniques for discrete-event systems rely on building the system state-transition graphs. A known critical issue… (More)

Is this relevant?

2004

2004

- Sanming Zhou
- Combinatorica
- 2004

Let Γ be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B with block size v. Let ΓB be the… (More)

Is this relevant?

2002

2002

- Pascal Ferraro, Christophe Godin
- Algorithmica
- 2002

In this paper we propose a dynamic programming algorithm to compare two quotiented trees using a constrained edit distance. A… (More)

Is this relevant?

2001

2001

- Andrew T. Baker
- 2001

We consider the Adams Spectral Sequence for R-modules based on commutative localized regular quotient ring spectra of a… (More)

Is this relevant?

1999

1999

- Roger Bielawski
- 1999

We classify those manifolds mentioned in the title which have finite topological type. Namely we show that any such connected M… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- PATRICK AMESTOYy, TIMOTHY A. DAVISz, IAIN S. DUFFx
- 1994

An Approximate Minimum Degree ordering algorithm (AMD) for preordering a symmetric sparse matrix prior to numerical factorization… (More)

Is this relevant?