Show simple item record

dc.contributor.authorIchishima, R.
dc.contributor.authorLópez Masip, Susana-Clara
dc.contributor.authorMuntaner Batle, F. A.
dc.contributor.authorRius Font, Miquel
dc.date.accessioned2019-07-02T11:28:41Z
dc.date.available2019-07-02T11:28:41Z
dc.date.issued2012
dc.identifier.issn0012-365X
dc.identifier.urihttp://hdl.handle.net/10459.1/66512
dc.description.abstractThe ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families of (super) edge-magic graphs and to prove that some of those families admit an exponential number of (super) edge-magic labelings. In this paper, we extend the use of the product ⊗h in order to study the well know harmonious, sequential, partitional and (a, d)-edge antimagic total labelings. We prove that if a (p, q)-digraph with p ≤ q is harmonious and h : E(D) −→ Sn is any function, then und(D ⊗h Sn) is harmonious. We obtain analogous results for sequential and partitional labelings. We also prove that if G is a (super) (a, d)-edge-antimagic total tripartite graph, then nG is (super) (a ′ , d)-edge-antimagic total, where n ≥ 3, and d = 0, 2 and n is odd, or d = 1. We finish the paper providing an application of the product ⊗h to an arithmetic classical result when the function h is constant.
dc.description.sponsorshipThe research conducted in this document by second and fourth 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.publisherElsevier
dc.relationMICINN/PN2008-2011/MTM2008-06620-C03-01
dc.relation.isformatofVersió postprint del document publicat a: https://doi.org/10.1016/j.disc.2011.08.025
dc.relation.ispartofDiscrete Mathematics, 2012, vol. 312, num. 2, p. 221-228
dc.rightscc-by-nc-nd (c) Elsevier, 2011
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectSuper edge-magic
dc.subjectHarmonious
dc.subject(a, d)-edge antimagic total
dc.subject⊗h-product
dc.titleThe power of digraph products applied to labelings
dc.typeinfo:eu-repo/semantics/article
dc.date.updated2019-07-02T11:28:42Z
dc.identifier.idgrec028475
dc.type.versioninfo:eu-repo/semantics/acceptedVersion
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.identifier.doihttps://doi.org/10.1016/j.disc.2011.08.025


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

cc-by-nc-nd (c) Elsevier, 2011
Except where otherwise noted, this item's license is described as cc-by-nc-nd (c) Elsevier, 2011