Loading...
Loading...

Go to the content (press return)

A family of Abelian Cayley digraphs with asymptotically large order

Author
Perez, S.; Aguilo, F.; Fiol, M.
Type of activity
Presentation of work at congresses
Name of edition
Workshop on Algebraic Combinatorics
Date of publication
2015
Presentation's date
2015-06-18
Abstract
In this talk we will deal with the degree-diameter problem of Cayley digraphs of Abelian groups. These digraphs can be constructed using a generalization to Zn of the concept of congruence in Z. We will use this approach to present an infinite family of such digraphs, which, for every fixed value of the degree, have asymptotically large number of vertices as the diameter increases.
Keywords
Digraphs - Dense digraphs
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants