Local Super Antimagic Total Labeling for Vertex Coloring of Graphs

Abstract

Let G = (V, E) be a graph with vertex set V and edge set E. A local antimagic total vertex coloring f of a graph G with vertex-set V and edge-set E is an injective map from V [ E to {1, 2, ... , |V| + |E|} such that if for each uv 2 E(G) then w(u) 6= w(v), where w(u) = Âuv2E(G) f(uv) + f(u). If the range set f satisfies f(V) = {1, 2, ... , |V|}, then the labeling is said to be local super antimagic total labeling. This labeling generates a proper vertex coloring of the graph G with the color w(v) assigning the vertex v. The local super antimagic total chromatic number of graph G, clsat(G) is defined as the least number of colors that are used for all colorings generated by the local super antimagic total labeling of G. In this paper we investigate the existence of the local super antimagic total chromatic number for some particular classes of graphs such as a tree, path, cycle, helm, wheel, gear, sun, and regular graphs as well as an amalgamation of stars and an amalgamation of wheels