Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Planarity Testing and Embedding Maurizio Patrignani Crossings and Planarization Christoph Buchheim, Markus Chimani, Carsten… Expand
Is this relevant?
2007
2007
This is the first in the series of articles stemming from a systematical investigation of finite edge-transitive tetravalent… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A graph is claw-free if no vertex has three pairwise nonadjacent neighbours. At first sight, there seem to be a great variety of… Expand
Is this relevant?
2004
2004
The normality of symmetry property of Cayley graphs of valencies 3 and 4 on the alternating group A5 is studied. We prove that… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Graphs.- Groups.- Transitive Graphs.- Arc-Transitive Graphs.- Generalized Polygons and Moore Graphs.- Homomorphisms.- Kneser… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • D. Knuth
  • Electron. J. Comb.
  • 1994
  • Corpus ID: 18152765
This report contains expository notes about a function vartheta(G) that is popularly known as the Lovasz number of a graph G… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Abstract A graph is weakly symmetric if its automorphism group is both vertex-transitive and edge-transitive. In 1971, Chao… Expand
  • table 1
Is this relevant?
Highly Cited
1984
Highly Cited
1984
  • P. Lorimer
  • Journal of Graph Theory
  • 1984
  • Corpus ID: 3202487
Let G be a group acting symmetrically on a graph Σ, let G1 be a subgroup of G minimal among those that act symmetrically on… Expand
Is this relevant?