On local antimagic chromatic number of lexicographic product graphs

preprint2022arXivOpen access

Abstract

Let G=(V,E)G = (V,E) be a connected simple graph of order pp and size qq. A graph GG is called local antimagic if GG admits a local antimagic labeling. A bijection f:E→{1,2,…,q}f : E \to \{1,2,\ldots,q\} is called a local antimagic labeling of GG if for any two adjacent vertices uu and vv, we have f+(u)≠f+(v)f^+(u) \ne f^+(v), where f+(u)=∑e∈E(u)f(e)f^+(u) = \sum_{e\in E(u)} f(e), and E(u)E(u) is the set of edges incident to uu. Thus, any local antimagic labeling induces a proper vertex coloring of GG if vertex vv is assigned the color f+(v)f^+(v). The local antimagic chromatic number, denoted χla(G)χ_{la}(G), is the minimum number of induced colors taken over local antimagic labeling of GG. Let GG and HH be two vertex disjoint graphs. The {\it lexicographic product} of GG and HH, denoted G[H]G[H], is the graph with vertex set V(G)×V(H)V(G) \times V(H), and (u,u′)(u,u') is adjacent to (v,v′)(v,v') in G[H]G[H] if (u,v)∈E(G)(u,v)\in E(G) or if u=vu=v and u′v′∈E(H)u'v'\in E(H). In this paper, we obtained sharp upper bound of χla(G[On])χ_{la}(G[O_n]) where OnO_n is a null graph of order n≥1n\ge 1. Sufficient conditions for even regular bipartite and tripartite graphs GG to have χla(G)=3χ_{la}(G)=3 are also obtained. Consequently, we successfully determined the local antimagic chromatic number of infinitely many (connected and disconnected) regular graphs that partially support the existence of rr-regular graph GG of order pp such that (i) χla(G)=χ(G)=kχ_{la}(G)=χ(G)=k, and (ii) χla(G)=χ(G)+1=kχ_{la}(G)=χ(G)+1=k for each possible r,p,kr,p,k.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.