paper

Abelian Cayley digraphs with asymptotically large order for any given degree

arXiv:1502.02744

Abstract

Abelian Cayley digraphs can be constructed by using a generalization to of the concept of congruence in . Here we use this approach to present a family of such digraphs, which, for every fixed value of the degree, have asymptotically large number of vertices as the diameter increases. Up to now, the best known asymptotically dense results were all non-constructive.

Abelian Cayley digraphs with asymptotically large order for any given degree · wovepaper