Add to ORKGA (p, q)-graph G is (a, d)-edge-antimagic total if there exists a bijective function f : V(G) ∪ E(G) → {1,2,...,p + q} such that the edge-weights w(uv) = f(u) + f(v) + f(uv), uv ∈ E(G), form an arithmetic progression starting from a and having common difference d. Moreover, G is said to be super (a, d)-edge-antimagic total if f(V(G)) = {1,2,..., p}. In this paper we study the super (a,d)-edge-antimagic total properties of certain classes of graphs, including ladders, generalized prisms and antiprisrns.C
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...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,.....
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
For a graph G = (V ,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is cal...
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f :...
An (a,d)-edge-antimagic total labeling of G is a one-to-one mapping f taking the vertices and edges ...
An <i>(a,d)-edge antimagic total labeling of a (p, q)</i>-graph G is bijection f:V∪E→{1,2,3,…,p+q} w...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
Let G = (V, E) be a simple, finite and undirected graph with v vertices and e edges, A graph labelin...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
AbstractFor a graph G=(V,E), a bijection g from V(G)∪E(G) into {1,2,…, |V(G)|+|E(G)|} is called (a,d...
Let G=(V,E) be a finite, simple, indirected and either connected or disconnected. A antimagic total ...
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...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,.....
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
For a graph G = (V ,E), a bijection g from V (G) ∪ E(G) into {1, 2, . . . , |V (G)| + |E(G)|} is cal...
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f :...
An (a,d)-edge-antimagic total labeling of G is a one-to-one mapping f taking the vertices and edges ...
An <i>(a,d)-edge antimagic total labeling of a (p, q)</i>-graph G is bijection f:V∪E→{1,2,3,…,p+q} w...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
Let G = (V, E) be a simple, finite and undirected graph with v vertices and e edges, A graph labelin...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
AbstractFor a graph G=(V,E), a bijection g from V(G)∪E(G) into {1,2,…, |V(G)|+|E(G)|} is called (a,d...
Let G=(V,E) be a finite, simple, indirected and either connected or disconnected. A antimagic total ...
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...
AbstractA labeling of a graph is a mapping that carries some set of graph elements into numbers (usu...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...