Symmetric graph

Known as: Arc-transitive graph, Flag-transitive graph, Foster Census 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
0102019732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Path planning is one of the most studied problems in the field of robotics, unmanned aerial vehicles (uavs), vehicle navigation… (More)
  • figure 4
  • figure 5
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
2014
2014
Random structures often present a trade-off between realism and tractability, the latter predominantly enabled by independence… (More)
Is this relevant?
2013
2013
University of Sydney 3. 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
This paper presents a novel symmetric graph regularization framework for pairwise constraint propagation. We first decompose the… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 4
Is this relevant?
2010
2010
Let Γ be a graph admitting an arc-transitive subgroup G of automorphisms that leaves invariant a vertex partition B with parts of… (More)
  • figure 1
Is this relevant?
2008
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
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
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
We find a natural construction of a large class of symmetric graphs from pointand block-transitive 1-designs. The graphs in this… (More)
  • figure 1
Is this relevant?
2000
2000
We introduce the notion of a symmetric graph design which is a common generalization of symmetric BIBDs and of orthogonal double… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?