On edge transitive circulant graphs (Q1922155)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 927032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On edge transitive circulant graphs |
scientific article; zbMATH DE number 927032 |
Statements
On edge transitive circulant graphs (English)
0 references
15 September 1996
0 references
This paper classifies those circulant graphs for which both the graph and its complement are edge-transitive. The author shows that such a graph must be either a disjoint union of copies of a complete graph, or the complement of such a disjoint union, or a Paley graph on a prime number of vertices. The proof is short, using a result of Schur on Burnside groups and a result of Chao on symmetric graphs with prime order. A digraph version of the result is also given.
0 references
circulant graphs
0 references
complement
0 references
Paley graph
0 references
symmetric graphs
0 references
digraph
0 references
0.8239132761955261
0 references
0.8071436882019043
0 references
0.7958351969718933
0 references
0.7929919362068176
0 references
0.7913605570793152
0 references
