The circulant graph Cn, S is the graph on n vertices (with labels 0, 1, 2,..., n− 1), spread
around a circle, where two vertices u and v are adjacent iff their (minimum) distance| u− v …

A circulant (di) graph is a (di) graph on n vertices that admits a cyclic automorphism of order
n. This paper provides a survey of the work that has been done on finding the automorphism …

The paper concerns the automorphism groups of Cayley graphs over cyclic groups which
have a rational spectrum (rational circulant graphs for short). With the aid of the techniques …

This paper deals with the enumeration of various families of Cayley graphs and digraphs.
Both the directed and undirected cases of the following three families are studied: Cayley …

By a suitable representation in the Euclidean plane, each circulant graph $ G $, ie a graph
with a circulant adjacency matrix ${\mathcal A}(G) $, reveals its rotational symmetry and, as …

Cayley graphs are constructed using groups. This chapter discusses algebraic and graph-
theoretic aspects of finite Cayley graphs. The algebraic aspects include recognition …

We characterize the automorphism groups of circulant digraphs whose connection sets are
relatively small, and of unit circulant digraphs. For each class, we either explicitly determine …

A reductive characterization of arc-transitive circulants was given independently by Kovács
in 2004 and the first author in 2005. In this paper, we give an explicit characterization of arc …

In this paper we focus on connected directed/undirected circulant graphs Cn (a, b). We
investigate some topological characteristics, and define a simple combinatorial model …

In this paper we determine the positive integers n and k for which there exists a
homogeneous factorisation of a complete digraph on n vertices with k 'common …