Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.603 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Centres de recerca
  • COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Centres de recerca
  • COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

New Moore-like bounds and some optimal families of abelian Cayley mixed graphs

Thumbnail
View/Open
Article principal (399,1Kb)
 
10.1007/s00026-020-00496-2
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/330469

Show full item record
Dalfó Simó, CristinaMés informacióMés informació
Fiol Mora, Miquel ÀngelMés informacióMés informacióMés informació
López Lorenzo, Nacho
Document typeArticle
Defense date2020-06
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
ProjectCONNECT - Combinatorics of Networks and Computation (EC-H2020-734922)
Abstract
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are Cayley graphs of Abelian groups. Such groups can be constructed by using a generalization to Z n of the concept of congruence in Z. Here we use this approach to present some families of mixed graphs, which, for every fixed value of the degree, have an asymptotically large number of vertices as the diameter increases. In some cases, the results obtained are shown to be optimal.
Description
The final publication is available at Springer via http://dx.doi.org/10.1007/s00026-020-00496-2
CitationDalfo, C.; Fiol, M.; López, N. New Moore-like bounds and some optimal families of abelian Cayley mixed graphs. "Annals of combinatorics", Juny 2020, vol. 24, p. 405-424. 
URIhttp://hdl.handle.net/2117/330469
DOI10.1007/s00026-020-00496-2
ISSN0218-0006
Publisher versionhttps://link.springer.com/article/10.1007/s00026-020-00496-2
Collections
  • COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions - Articles de revista [290]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
mixedabeliancayley-31juliol2019-rev-19maig2020.pdfArticle principal399,1KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina