AbstractThe ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. [15] 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 labelings. In this paper, we extend the use of the product ⊗h in order to study the well know harmonious, sequential, partitional and (a,d)-edge antimagic total labelings. We prove that if a (p,q)-digraph with p≤q is harmonious and h:E(D)⟶Sn is any function, then und(D⊗hSn) is harmonious. We obtain analogous results for sequential and partitional labelings. We also prove that if G is a (super) (a,d)-edge-antimagic total tripartite graph, then nG is (super) (a′,d)-edge-antimagic total, where n≥3, and d=0,2 and n ...
AbstractKotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et ...
A labeling of a graph is a mapping that carries some sets of graph elements into numbers (usually th...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
The ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families ...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V(G) ∪ E(G) ont...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
A (p, q)-graph G is (a, d)-edge-antimagic total if there exists a bijective function f : V(G) ∪ E(G)...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,.....
Let G = (V, E) be a simple, finite and undirected graph with v vertices and e edges, A graph labelin...
An edge magic total labeling of graph with p vertices and q edges is a bijection from the set of ver...
Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications ...
AbstractKotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et ...
A labeling of a graph is a mapping that carries some sets of graph elements into numbers (usually th...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
The ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families ...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
An (a, d)-edge-antimagic total labeling on (p, q)-graph G is a one-to-one map f from V(G) ∪ E(G) ont...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
A (p, q)-graph G is (a, d)-edge-antimagic total if there exists a bijective function f : V(G) ∪ E(G)...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,.....
Let G = (V, E) be a simple, finite and undirected graph with v vertices and e edges, A graph labelin...
An edge magic total labeling of graph with p vertices and q edges is a bijection from the set of ver...
Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications ...
AbstractKotzig and Rosa conjectured that every tree admits an edge-magic total labeling. Enomoto et ...
A labeling of a graph is a mapping that carries some sets of graph elements into numbers (usually th...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...