On edge transitive circulant graphs
type: Item
instance of: scholarly article
title: On edge transitive circulant graphs
zbMATH Open document ID: 0860.05042
author: Hong Zhang
published in: Tokyo Journal of Mathematics
publication date: 1996-09-15T00:00:00Z
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.
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 927032
zbMATH Keywords: circulant graphs
zbMATH Keywords: complement
zbMATH Keywords: Paley graph
zbMATH Keywords: symmetric graphs
zbMATH Keywords: digraph
reviewed by: Albert J. Goodman
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3836/tjm/1270043218
OpenAlex ID: W2058913799
DOI: 10.3836/TJM/1270043218
description: scientific article; zbMATH DE number 927032