| Summary: | Let G = (V, E) be a connected graph with |V| = n and |E| = m. A bijection f: V(G) ∪ E(G) → {1, 2, · · ·, n + m} is called local antimagic total labeling if, for any two adjacent vertices u and v, ωt (u) ̸= ωt (v), where ωt (u) = f (u) + ∑e∈E(u) f (e), and E(u) is the set of edges incident to u. Thus, any local antimagic total labeling induces a proper coloring of G, where the vertex x in G is assigned the color ωt (x). The local antimagic total chromatic number, denoted by χl at (G), is the minimum number of colors taken over all colorings induced by local antimagic total labelings of G. In this paper, we present the local antimagic total chromatic numbers of some wheel-related graphs, such as the fan graph Fn, the bowknot graph Bn,n, the Dutch windmill graph D4n, the analogous Dutch graph AD4nand the flower graphF n. © 2022 by the authors. Licensee MDPI, Basel, Switzerland.
|
|---|
