Labeling constructions using digraph products

View/ Open
Issue date
2013Suggested citation
López Masip, Susana-Clara;
Muntaner Batle, F. A.;
Rius Font, Miquel;
.
(2013)
.
Labeling constructions using digraph products.
Discrete Applied Mathematics, 2013, vol. 161, num. 18, p. 3005-3016.
https://doi.org/10.1016/j.dam.2013.06.006.
Metadata
Show full item recordAbstract
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 edge-magic labelings of 2-regular graphs with exactly two components and their implications to other labelings. The strength of the paper lays on the techniques used, since they are not only used in order to provide labelings of many different types of families of graphs, but they also show interesting relations among well studied types of labelings. We are able to obtain, in this way, deep results relating different types of labelings.
Is part of
Discrete Applied Mathematics, 2013, vol. 161, num. 18, p. 3005-3016European research projects
Collections
Related items
Showing items related by title, author, creator and subject.
-
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 ... -
A new labeling construction from the ⊗h-product
López Masip, Susana-Clara; Muntaner Batle, F. A.; Prabu, M. (Elsevier, 2017)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 ... -
(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 ...