Show simple item record

dc.contributor.authorAhmad, Ali
dc.contributor.authorLópez Masip, Susana-Clara
dc.contributor.authorMuntaner Batle, F. A.
dc.contributor.authorRius Font, Miquel
dc.date.accessioned2019-03-26T13:25:48Z
dc.date.available2019-03-26T13:25:48Z
dc.date.issued2011
dc.identifier.issn0004-9727
dc.identifier.urihttp://hdl.handle.net/10459.1/66072
dc.description.abstractA super edge-magic labeling of a graph G=(V,E) of order p and size q is a bijection f:V ∪E→{i}p+qi=1 such that: (1) f(u)+f(uv)+f(v)=k for all uv∈E; and (2) f(V )={i}pi=1. Furthermore, when G is a linear forest, the super edge-magic labeling of G is called strong if it has the extra property that if uv∈E(G) , u′,v′ ∈V (G) and dG (u,u′ )=dG (v,v′ )<+∞, then f(u)+f(v)=f(u′ )+f(v′ ). In this paper we introduce the concept of strong super edge-magic labeling of a graph G with respect to a linear forest F, and we study the super edge-magicness of an odd union of nonnecessarily isomorphic acyclic graphs. Furthermore, we find exponential lower bounds for the number of super edge-magic labelings of these unions. The case when G is not acyclic will be also considered.
dc.description.sponsorshipThe research conducted in this document by second and forth author has been supported by the Spanish Research Council under project MTM2008-06620-C03-01 and by the Catalan Research Council under grant 2009SGR1387.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.publisherCambridge University Press
dc.relationMICINN/PN2008-2011/MTM2008-06620-C03-01
dc.relation.isformatofVersió preprint del document publicat a: https://doi.org/10.1017/S0004972711002292
dc.relation.ispartofBulletin of the Australian Mathematical Society, 2011, vol. 84, num. 2, p. 310-321
dc.rights(c) Australian Mathematical Publishing Association, 2011
dc.titleEnumerating super edge-magic labelings for the union of nonisomorphic graphs
dc.typeinfo:eu-repo/semantics/article
dc.date.updated2019-03-26T13:25:48Z
dc.identifier.idgrec028473
dc.type.versioninfo:eu-repo/semantics/submittedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.doihttps://doi.org/10.1017/S0004972711002292


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record