Now showing items 1-6 of 6

• #### A new labeling construction from the ⊗h-product ﻿

(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 decompositions and magic type labelings: a dual relation ﻿

(Springer, 2020-10)
A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1, 2, . . . , |V (G)| + |E(G)|} such that the sum f(x) + f(xy) + f(y) for any xy in E(G) is constant. Such ...
• #### Labeling constructions using digraph products ﻿

(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 ...
• #### New problems related to the valences of (super) edge-magic labelings ﻿

(2013)
A graph G of order p and size q is edge-magic if there is a bijective function f : V (G) ∪ E(G) −→ {i} p+q i=1 such that f(x) + f(xy) + f(y) = k , for all xy ∈ E(G) . The function f is an edge-magic labeling of G and the ...
• #### Perfect (super) Edge-Magic Crowns ﻿

(Springer, 2017)
A graph G is called edge-magic if there is a bijective function f from the set of vertices and edges to the set {1,2, ,|V(G)|+|E(G)|} such that the sum f(x)+f(xy)+f(y) for any xy in E(G) is constant. Such a function is ...
• #### The power of digraph products applied to labelings ﻿

(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 ...