On edge transitive circulant graphs

DOI10.3836/TJM/1270043218MaRDI QIDQ1922155zbMATH OpenOpenAlexFDO

Authors Hong Zhang

Publication date 15 September 1996

Published in Tokyo Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3836/tjm/1270043218

zbMATH Keywords

circulant graphscomplementdigraphPaley graphsymmetric graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Review text

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.

Recommendations

• On 2-distance-transitive circulants
• Normal edge-transitive circulant graphs
• Classifying arc-transitive circulants
• Edge-transitive graphs and combinatorial designs
• On certain edge-transitive bicirculants of twice odd order

Cited in

(9)

• On the number of edges in the transitive closure of a graph
• Edge-transitive strips
• Edge-disjoint circuits in graphs on the torus
• On adjacency-transitive graphs
• On 2-distance-transitive circulants
• Circulants and the Characterization of Vertex-Transitive Graphs
• On edge-transitive graphs of square-free order
• All self-complementary symmetric graphs
• Conformally rigid graphs

This page was built for publication: On edge transitive circulant graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1922155)