AbstractA graph G of order p and size q is called (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 sequence with first term a and common difference d. The graph G is said to be super (a,d)-edge-antimagic total if the vertex labels are 1,2,…,p. In this paper we study super (a,d)-edge-antimagic properties of mKn, that is, of the graph formed by the disjoint union of m copies of Kn
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
AbstractLet G=(V,E) be a finite, simple and non-empty (p,q)-graph of order p and size q. An (a,d)-ve...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
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...
Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a b...
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...
Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a b...
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...
Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a b...
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f :...
A (p, q)-graph G is (a, d)-edge-antimagic total if there exists a bijective function f : V(G) ∪ E(G)...
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,.....
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 ...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
AbstractLet G=(V,E) be a finite, simple and non-empty (p,q)-graph of order p and size q. An (a,d)-ve...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
AbstractA graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijec...
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...
Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a b...
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...
Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a b...
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...
Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a b...
A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f :...
A (p, q)-graph G is (a, d)-edge-antimagic total if there exists a bijective function f : V(G) ∪ E(G)...
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,.....
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 ...
AbstractLet G=(V,E) be a finite, simple and undirected graph. The edge-magic total or vertex-magic t...
AbstractLet G=(V,E) be a finite, simple and non-empty (p,q)-graph of order p and size q. An (a,d)-ve...