Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423735 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
We give a method for constructing infinite families of dense (or eventually likely dense) Cayley digraphs of finite Abelian groups. The diameter of the digraphs is obtained by means of the related minimum distance diagrams. A dilating technique for these diagrams, which can be used for any degree of the digraph, is applied to generate the digraphs of the family. Moreover, two infinite families of digraphs with distinguished metric properties will be given using these methods. The first family contains digraphs with asymptotically large ratio between the order and the diameter as the degree increases (moreover it is the first known asymptotically dense family). The second family, for fixed degree d = 3, contains digraphs with the current best known density.