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 …

Local Edge Antimagic Coloring of Comb Product of Graphs Page 1 Journal of Physics:
Conference Series PAPER • OPEN ACCESS Local Edge Antimagic Coloring of Comb Product …

We consider that all graph in this paper are finite, simple and connected graph. A graceful k−
coloring of a graph is a proper vertex coloring f: V (G)→{1, 2,..., k}, where k≥ 2 which …

Abstract Let G (V, E) be a graph of vertex set V and edge set E. Local vertex antimagic total
coloring developed from local edge and local vertex antimagic coloring of graph. Local …

Super local edge antimagic total coloring of Page 1 Journal of Physics: Conference Series
PAPER • OPEN ACCESS Super local edge antimagic total coloring of To cite this article: Elsa …

In this paper we study a new notion of coloring type of graph, namely a local irregularity
vertex coloring. We define is called vertex irregular-labeling and where. By a local …

Abstract Let G=(V, E) be a graph of order p and size q having no isolated vertices. A bijection
f: V→{1, 2, 3,..., p} is called a local edge antimagic labeling if for any two adjacent edges e …

Suppose a graph is a simple, connected and finite graph with vertex set and an edge set.
The local edge antimagic coloring is a combination of local antimagic labelling and edge …

Abstract Let $ G=(V, E) $ be a simple, connected and un-directed graph. Given that a map $
f: E (G)\longrightarrow\{1, 2, 3,\dots,| E (G)|\} $. We define a vertex weight of $ v\in V $ as $ w …

A graph G is an ordered pair of sets G (V, E), where V is a set of vertices and the elements of
set E are usually called edges. The concept of graph labeling has recently gained a lot of …