paper

Every Graph Is Local Antimagic Total And Its Applications To Local Antimagic (Total) Chromatic Numbers

arXiv:1906.10332

Abstract

A graph of order and size is said to be local antimagic if there exists a bijection such that for any pair of adjacent vertices and , , where is the induced vertex color of under . We also say is local antimagic total if there exists a bijection such that for any pair of adjacent vertices and , , where is the induced vertex weight of under . The local antimagic (and local antimagic total) chromatic number of , denoted (and ), is the minimum number of distinct induced vertex colors (and weights) over all local antimagic (and local antimagic total) labelings of . We also say a local antimagic total labeling is local super antimagic total if for each . In [Proof of a local antimagic conjecture, {\it Discrete Math. Theor. Comp. Sc.}, {\bf 20(1)} (2018), \#18], the author proved that every connected graph of order at least 3 is local antimagic. Using this result, we provide a very short proof that every graph is local antimagic total. We showed that there exists close relationship between and . A sufficient condition is also given for the corresponding local super antimagic total labeling. Sharp bounds of and close relationships between and are found. Bounds of in terms of for a graph with an edge deleted are also obtained. These relationships are used to determine the exact values of for many graphs . We also conjecture that each graph of order at least 3 has .

It is extended to 27 pages with many more new results

References in corpus (3)

Cited by in corpus (1)