In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of… (More)

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

2015

2015

- Jie Jia, Jeng-Shyang Pan, Huarong Xu, Chen Wang, Zhenyu Meng
- 2015 Third International Conference on Robot…
- 2015

Path planning is one of the most studied problems in the field of robotics, unmanned aerial vehicles (uavs), vehicle navigation… (More)

Is this relevant?

2014

2014

- Dimitris Achlioptas, Paris Siminelakis
- ArXiv
- 2014

Random structures often present a trade-off between realism and tractability, the latter predominantly enabled by independence… (More)

Is this relevant?

2013

2011

2011

- Zhenyong Fu, Zhiwu Lu, Horace Ho-Shing Ip, Yuxin Peng, Hongtao Lu
- AAAI
- 2011

This paper presents a novel symmetric graph regularization framework for pairwise constraint propagation. We first decompose the… (More)

Is this relevant?

2010

2010

- Cai Heng Li, Cheryl E. Praeger, Sanming Zhou
- Eur. J. Comb.
- 2010

Let Γ be a graph admitting an arc-transitive subgroup G of automorphisms that leaves invariant a vertex partition B with parts of… (More)

Is this relevant?

2008

2008

- Peter J. Cameron
- 2008

The core of a graph Γ is the smallest graph ∆ which is homomorphically equivalent to Γ (that is, there exist homomorphisms in… (More)

Is this relevant?

2006

2006

- Cai Heng Li, Zai Ping Lu, Hua Zhang
- J. Comb. Theory, Ser. B
- 2006

A characterisation is given of edge-transitive Cayley graphs of valency 4 on odd number of vertices. The characterisation is then… (More)

Is this relevant?

2003

2003

- Sanming Zhou
- 2003

With any G-symmetric graph admitting a nontrivial G-invariant partition B, we may associate a natural ‘‘cross-sectional… (More)

Is this relevant?

2002

2002

- Sanming Zhou
- Eur. J. Comb.
- 2002

We find a natural construction of a large class of symmetric graphs from pointand block-transitive 1-designs. The graphs in this… (More)

Is this relevant?

2000

2000

- Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa, Paul J. Schellenberg
- Graphs and Combinatorics
- 2000

We introduce the notion of a symmetric graph design which is a common generalization of symmetric BIBDs and of orthogonal double… (More)

Is this relevant?