A note on local antimagic chromatic number of lexicographic product graphs

Let $G = (V,E)$ be a connected simple graph. A bijection $f: E \rightarrow \{1,2,\ldots,|E|\}$ is called a local antimagic labeling of $G$ if $f^+(u) \neq f^+(v)$ holds for any two adjacent vertices $u$ and $v$, where $f^+(u) = \sum_{e\in E(u)} f(e)$ and $E(u$) is the set of edges incident to $u$. A graph $G$ is called local antimagic if $G$ admits at least a local antimagic labeling. The local antimagic chromatic number, denoted $χ_{la}(G)$, is the minimum number of induced colors taken over local antimagic labelings of $G$. Let $G$ and $H$ be two disjoint graphs. The graph $G[H]$ is obtained by the lexicographic product of $G$ and $H$. In this paper, we obtain sufficient conditions for $χ_{la}(G[H])\leq χ_{la}(G)χ_{la}(H)$. Consequently, we give examples of $G$ and $H$ such that $χ_{la}(G[H]) = χ(G)χ(H)$, where $χ(G)$ is the chromatic number of $G$. We conjecture that (i) there are infinitely many graphs $G$ and $H$ such that $χ_{la}(G[H])=χ_{la}(G)χ_{la}(H) = χ(G)χ(H)$, and (ii) for $k\ge 1$, $χ_{la}(G[H]) = χ(G)χ(H)$ if and only if $χ(G)χ(H) = 2χ(H) + \lceil\frac{χ(H)}{k}\rceil$, where $2k+1$ is the length of a shortest odd cycle in $G$.

No reviews yet.

No comments yet.