Mostra el registre d'ítem simple
Abelian Cayley digraphs with asymptotically large order for any given degree
| dc.contributor.author | Aguiló Gost, Francisco de Asis L. |
| dc.contributor.author | Fiol Mora, Miquel Àngel |
| dc.contributor.author | Pérez Mansilla, Sonia |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtiques |
| dc.date.accessioned | 2017-01-17T08:34:07Z |
| dc.date.available | 2017-01-17T08:34:07Z |
| dc.date.issued | 2016-04-29 |
| dc.identifier.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. |
| dc.identifier.issn | 1077-8926 |
| dc.identifier.uri | http://hdl.handle.net/2117/99392 |
| dc.description.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. |
| dc.format.extent | 11 p. |
| dc.language.iso | eng |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
| dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
| dc.subject.lcsh | Graph theory |
| dc.subject.other | Cayley digraph |
| dc.subject.other | degree/diameter problem |
| dc.subject.other | density |
| dc.subject.other | Smith normal form |
| dc.subject.other | congruences in Z(n) |
| dc.subject.other | TRIPLE LOOP NETWORKS |
| dc.subject.other | DIAMETER |
| dc.title | Abelian Cayley digraphs with asymptotically large order for any given degree |
| dc.type | Article |
| dc.subject.lemac | Grafs, Teoria de |
| dc.contributor.group | Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| dc.description.peerreviewed | Peer Reviewed |
| dc.subject.ams | Classificació AMS::05 Combinatorics::05C Graph theory |
| dc.relation.publisherversion | http://www.combinatorics.org/ojs/index.php/eljc |
| dc.rights.access | Open Access |
| local.identifier.drac | 17744304 |
| dc.description.version | Postprint (author's final draft) |
| dc.relation.projectid | info:eu-repo/grantAgreement/MICINN//MTM2011-28800-C02-01/ES/OPTIMIZACION Y PROBLEMAS EXTREMALES EN TEORIA DE GRAFOS Y COMBINATORIA. APLICACIONES A LAS REDES DE COMUNICACION./ |
| local.citation.author | Aguilo, F.; Fiol, M.; Perez, S. |
| local.citation.publicationName | Electronic journal of combinatorics |
| local.citation.volume | 23 |
| local.citation.number | 2 |
| local.citation.startingPage | 1 |
| local.citation.endingPage | 11 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [3.268]
-
Articles de revista [290]