New results on the degree/diameter problem of mixed Abelian Cayley graphs

Abstract

Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are Cayley graphs of Abelian groups. Such groups can be constructed by using a generalization to Z n of the concept of congruence in Z. Here we use this approach to present some families of mixed graphs, which, for every fixed value of the degree, have an asymptotically large number of vertices as the diameter increases. In some cases, the results obtained are shown to be optimal.