A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Graph theory, and graph labeling in particular, are fast-growing research areas in
mathematics. New results are constantly being discovered and published at a rapidly …

All graph in this paper are finite, simple and connected graph. Let G (V, E) be a graph of
vertex set V and edge set E. A bijection $ f: V (G)\to\{1, 2, 3,\ldots,| V (G)|\} $ is called a local …

In this paper, we consider that all graphs are finite, simple and connected. Let G (V, E) be a
graph of vertex set V and edge set E. A bijection $ f: V (G)\to\{1, 2, 3,\ldots,| V (G)|\} $ is called …

A graph G of order p and size q is called an (a, d)-edge-antimagic total if there exists a
bijection f: V (G) UE (G)--->{1, 2,...., p+ q} such that the edge-weights, w (uv)= f (u)+ f (v)+ f …

Various types of labelings of graphs have been intensively studied by combinatorialists for
some time. The notion of magic labeling has its origin in very classical Chinese mathematics …

Let H be a simple and connected graph. A shackle of graph H, denoted by G= shack (H, v,
n), is a graph G constructed by non-trivial graphs H 1, H 2,..., H n such that, for every 1≤ s …

Let L and H be two simple, nontrivial and undirected graphs. Let o be a vertex of H, the comb
product between L and H, denoted by L▹ H, is a graph obtained by taking one copy of L …

A labeling of a graph is a mapping that carries some set of graph elements into numbers
(usually positive integers). An (a, d)-edge-antimagic total labeling of a graph with p vertices …

A labeling of a graph is a mapping that carries some sets of graph elements into numbers
(usually the positive integers). An (a, d)-edge-antimagic total labeling of a graph G (V, E) …