On rainbow antimagic coloring of special graphs

Abstract

Abstract Let G(V, E) be a connected, undirected and simple graph with vertex set V(G) and edge set E(G). A labeling of a graph G is a bijection f from V(G) to the set {1, 2,…, | V(G)|}. The bijection f is called rainbow antimagic vertex labeling if for any two edge uv and u’v’ in path x — y,w(uv) = w(u’v’) w(uv), where w(uv) = f (u) + f (v) and x,y ∈ V(G). A graph G is a rainbow antimagic connection if G has a rainbow antimagic labeling. Thus any rainbow antimagic labeling induces a rainbow coloring of G where the edge uv is assigned with the color w(uv). The rainbow antimagic connection number of G, denoted by rac(G), is the smallest number of colors taken over all rainbow colorings induced by rainbow antimagic labeling of G. In this paper, we show the exact value of the rainbow antimagic connection number of jahangir graph J2,m, lemon graph Lem, firecracker graph (Fm,3), complete bipartite graph (K2,m), and double star graph (Sm,m).