A graph labeling is an assignment of the elements of a certain set (usually the integers) to the vertices or edges, or both subject to certain conditions. Rosa introduced in 1967, the concept of graceful labeling as a way to attack the Ringel'conjecture that states that every tree T of
order p decomposes K2p+1 into 2p+1 copies of T, a conjecture that still remains open. Graceful labelings are the origin of the graph labeling area and many other labelings have emerged and have been studied since....
A graph labeling is an assignment of the elements of a certain set (usually the integers) to the vertices or edges, or both subject to certain conditions. Rosa introduced in 1967, the concept of graceful labeling as a way to attack the Ringel'conjecture that states that every tree T of
order p decomposes K2p+1 into 2p+1 copies of T, a conjecture that still remains open. Graceful labelings are the origin of the graph labeling area and many other labelings have emerged and have been studied since. Among them, we highlight harmonious labelings [4] for the number
of papers related to, and we also highlight super edge-magic labelings [1] due to the links with other labelings.
Figueroa{Centeno et al. introduced in [2] the following product of digraphs. Let D be a digraph and let ¿ = fFigmi
=1 be a family of digraphs such that V (Fi) = V , for every i 2 [1;m]. Consider any function h : E(D) ¿! ¿. Then the product D
h ¿ is the digraph with vertex set V (D)V
and ((a; x); (b; y)) 2 E(D h ¿) if and only if (a; b) 2 E(D) and (x; y) 2 E(h(a; b)). The strength of the contribution (see [5{7]) lays on the use of
h-product not only to provide labelings of many dierent types of families of graphs, but also to show interesting relationships
among well studied types of labelings. We are able to obtain, in this way, deep results relating dierent types of labelings.
Share
