Show simple item record

Authordc.contributor.authorMatamala Vásquez, Martín 
Authordc.contributor.authorZamora, José 
Admission datedc.date.accessioned2020-06-26T22:14:03Z
Available datedc.date.available2020-06-26T22:14:03Z
Publication datedc.date.issued2020
Cita de ítemdc.identifier.citationDiscrete Applied Mathematics 281 (2020) 246–251es_ES
Identifierdc.identifier.other10.1016/j.dam.2019.10.011
Identifierdc.identifier.urihttp://repositorio.uchile.cl/handle/2250/175692
Abstractdc.description.abstractHartsfield and Ringel in 1990 conjectured that any connected graph with q >= 2 edges has an edge labeling f with labels in the set {1,..., q}, such that for every two distinct vertices u and v, f(u) not equal= f(v), where f(v) = Sigma(e is an element of E(v)) f (e), and E(v) is the set of edges of the graph incident to vertex v. We say that a graph G = (V, E), with q edges, is universal antimagic, if for every set B of q positive numbers there is a bijection f : E -> B such that f(u) not equal= f(v), for any two distinct vertices u and v. It is weighted universal antimagic if for any vertex weight function w and every set B of q positive numbers there is a bijection f : E -> B such that w(u) + f(u) not equal= w(v) + f(v), for any two distinct vertices u and v. In this work we prove that paths, cycles, and graphs whose connected components are cycles or paths of odd lengths are universal antimagic. We also prove that a split graph and any graph containing a complete bipartite graph as a spanning subgraph is universal antimagic. Surprisingly, we are also able to prove that any graph containing a complete bipartite graph K-n,K-m with n, m >= 3 as a spanning subgraph is weighted universal antimagic. From all the results we can derive effective methods to construct the labelings.es_ES
Patrocinadordc.description.sponsorshipBasal program Grant PIA AFB-170001 Nucleo Milenio Informacion y Coordinacion en Redes ICM/FIC RC130003es_ES
Lenguagedc.language.isoenes_ES
Publisherdc.publisherElsevieres_ES
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/*
Sourcedc.sourceDiscrete Applied Mathematicses_ES
Keywordsdc.subjectAntimagic graphses_ES
Keywordsdc.subjectSplit graphses_ES
Keywordsdc.subjectComplete bipartite graphses_ES
Títulodc.titleGraphs admitting antimagic labeling for arbitrary sets of positive numberses_ES
Document typedc.typeArtículo de revistaes_ES
Catalogueruchile.catalogadorlajes_ES
Indexationuchile.indexArtículo de publicación ISIes_ES


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile