Loading...
Loading...

Go to the content (press return)

Abelian Cayley digraphs with asymptotically large order for any given degree

Author
Aguilo, F.; Fiol, M.; Perez, S.
Type of activity
Journal article
Journal
Electronic journal of combinatorics
Date of publication
2016-04-29
Volume
23
Number
2
First page
1
Last page
11
Project funding
Optimización y problemas extremales en teoria de grafos y combinatoria. Aplicacions a les redes de comunicación
Repository
http://hdl.handle.net/2117/99392 Open in new window
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p19 Open in new window
URL
http://www.combinatorics.org/ojs/index.php/eljc Open in new window
Abstract
Abelian Cayley digraphs can be constructed by using a generalization to Z(n) of the concept of congruence in Z. 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 large dense results were all non-constructive.
Citation
Aguilo, F., Fiol, M., Perez, S. Abelian Cayley digraphs with asymptotically large order for any given degree. "Electronic journal of combinatorics", 29 Abril 2016, vol. 23, núm. 2, p. 1-11.
Keywords
Cayley digraph, DIAMETER, Smith normal form, TRIPLE LOOP NETWORKS, congruences in Z(n), degree/diameter problem, density
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Attachments