A new labeling construction from the ⊗h-product

View/ Open
Issue date
2017Suggested citation
López Masip, Susana-Clara;
Muntaner Batle, F. A.;
Prabu, M.;
.
(2017)
.
A new labeling construction from the ⊗h-product.
Discrete Mathematics, 2017, vol. 340, num. 8, p. 1903-1909.
https://doi.org/10.1016/j.disc.2017.03.022.
Metadata
Show full item recordAbstract
The -product that is referred in the title was introduced in 2008 as a generalization of the Kronecker product of digraphs. Many relations among labelings have been obtained since then, always using as a second factor a family of super edge-magic graphs with equal order and size. In this paper, we introduce a new labeling construction by changing the role of the factors. Using this new construction the range of applications grows up considerably. In particular, we can increase the information about magic sums of cycles and crowns.
Is part of
Discrete Mathematics, 2017, vol. 340, num. 8, p. 1903-1909European research projects
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
Labeling constructions using digraph products
López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Elsevier, 2013)In this paper we study the edge-magicness of graphs with equal size and order, and we use such graphs and digraph products in order to construct labelings of different classes and of different graphs. We also study super ... -
The power of digraph products applied to labelings
Ichishima, R.; López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Elsevier, 2012)The ⊗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 ... -
(Di)graph products, labelings and related results
López Masip, Susana-Clara (Elsevier, 2017)Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can ...