Search
Now showing items 1-2 of 2
Super local edge antimagic total coloring of Pn . H
(2018-07-04)
In this paper, we consider that all graphs are ¯nite, simple and connected.
Let G(V; E) be a graph of vertex set V and edge set E. A bijection f : V (G) ¡!
f1; 2; 3; :::; jV (G)jg is called a local edge antimagic labeling ...
On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique
(2019-07-25)
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. By a edge local antimagic total labeling, we mean a bijection f:V(G)∪E(G)→{1,2,3,...,|V(G)|+|E(G)|} ...