Abelian Cayley digraphs with asymptotically large order for any given degree

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/99392

Title:	Abelian Cayley digraphs with asymptotically large order for any given degree
Author:	Aguiló Gost, Francisco de Asis L.; Fiol Mora, Miquel Àngel; Pérez Mansilla, Sonia
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
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.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs -Graph theory -Cayley digraph -degree/diameter problem -density -Smith normal form -congruences in Z(n) -TRIPLE LOOP NETWORKS -DIAMETER -Grafs, Teoria de -Classificació AMS::05 Combinatorics::05C Graph theory
Rights:	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Submitted version Article
Share: