Abstract
A Γ-supermagic labeling of a graph G(V, E) with (Formula presented.) is a bijection from E to an Abelian group Γ of order k such that the sum of labels of all incident edges of every vertex (Formula presented.) is equal to the same element (Formula presented.) An existence of a (Formula presented.) -supermagic labeling of Cartesian product of two cycles, (Formula presented.) for n odd was proved recently. This along with an earlier result by Ivančo proved the existence of a (Formula presented.) -supermagic labeling of (Formula presented.) for every (Formula presented.) In this paper we present a simple unified labeling method for all (Formula presented.).
Original language | English (US) |
---|---|
Pages (from-to) | 952-954 |
Number of pages | 3 |
Journal | AKCE International Journal of Graphs and Combinatorics |
Volume | 17 |
Issue number | 3 |
DOIs | |
State | Published - 2020 |
Bibliographical note
Publisher Copyright:© 2020 The Author(s). Published with license by Taylor & Francis Group, LLC.
Keywords
- Cartesian product of cycles
- Magic-type labeling
- group supermagic labeling
- supermagic labeling
- vertex-magic edge labeling