Search
Now showing items 1-3 of 3
Local Edge Antimagic Coloring of Comb Product of Graphs
(2018-07-03)
All graph in this paper are ¯nite, simple and connected graph. 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 if for any ...
LOCAL EDGE ANTIMAGIC COLORING OF GRAPHS
(2018-02-28)
All graphs considered in this paper are finite, simple and connected graphs. Let G(V, E) be a graph with the vertex set V and the edge set E, and let w be the edge weight of graph G. Then a bijection f: V (G) → {1, 2, 3, ...
Super (a, d)-Cycles-Antimagic Labeling of Subdivision of a Fan Graph
(2018-12-21)
We consider a simple, connected and undirected graph ( )EVG , with
vertex set
()GV and edge set ( ).GE There is a super ( ) H-, da -
antimagic total labeling on the graph ( )EVG , if there exists
a ...