EXTREMAL CAYLEY DIGRAPHS OF FINITE ABELIAN GROUPS

Cayley digraphs of finite abelian groups are often used to model communication networks. Because of their applications, extremal Cayley digraphs have been studied extensively in recent years. Given any positive integers d and k. Let m(*)(d, k) denote the largest positive integer m such that there exists an m-element finite abelian group and a k-element subset A of Gamma such that diam(Cay(Gamma, A)) <= d, where diam(Cay(Gamma, A)) denotes the diameter of the Cayley digraph Cay(Gamma, A) of generated by A. Similarly, let m(d, k) denote the largest positive integer m such that there exists a k-element set A of integers with diam(Z(m), A)) <= d. In this paper, we prove, among other results, that m(*)(d, k) = m(d, k) for all d >= 1 and k >= 1. This means that the finite abelian group whose Cayley digraph is optimal with respect to its diameter and degree can be a cyclic group.