Authors: S Arumugam K Premalatha Martin Bača Andrea SemaničováFeňovčíková
Publish Date: 2017/01/07
Volume: 33, Issue: 2, Pages: 275-285
Abstract
Let G=VE be a connected graph with left V right =n and left E right = m A bijection fE rightarrow 12 dots m is called a local antimagic labeling if for any two adjacent vertices u and v wune wv where wu=sum nolimits ein Eufe and Eu is the set of edges incident to u Thus any local antimagic labeling induces a proper vertex coloring of G where the vertex v is assigned the color wv The local antimagic chromatic number chi laG is the minimum number of colors taken over all colorings induced by local antimagic labelings of G In this paper we present several basic results on this new parameter
Keywords: