| Summary: | An edge labeling of a graph G = (V, E) is said to be local antimagic if there is a bijection f: E → {1,…, |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label is f+(x) = Σ f (e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. For a bipartite circulant graph G, it is known that χ(G) = 2 but χla(G) ≥ 3. Moreover, χla(Cn ∨ K1) = 3 (respectively 4) if n is even (respectively odd). Let G be a graph of order m ≥ 3. In [Affirmative solutions on local antimagic chromatic number, Graphs Combin., 36 (2020), 1337—1354], the authors proved that if m ≡ n (mod 2) with χla(G) = χ(G), m?> n ≥ 4 and m ≥ n2/2, then χla(G ∨On) = χla(G)+1. In this paper, we show that the conditions can be omitted in obtaining χla(G ∨H) for some circulant graph G, and H is a null graph or a cycle. The local antimagic chromatic number of certain wheel related graphs are also obtained. © (2023), (SciELO-Scientific Electronic Library Online). All Rights Reserved.
|
|---|