No Detail Found!

On the local antimagic chromatic number of the lexicographic product of graphs

Author(s)
Gee-Choon Lau College of Computing, Informatics & Media, Universiti Teknologi MARA (Johor Branch,Segamat Campus),Malaysia
Wai Chee Shiu Department of Mathematics, The Chinese University of Hong Kong,Shatin, Hong Kong,China
Premalatha Kanthavadivel National Centre for Advanced Research in Discrete Mathematics, Kalasalingam Academy of Research and Education,Krishnankoil,India
Ruixue Zhang School of Mathematics and Statistics, Qingdao University,Qingdao,China
Nalliah Movirichettiar Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology,Vellore,India
Abstract
Let G = (V; E) be a connected simple graph. A bijection f : E ! f1; 2; : : : ; jEjg is said to be a local antimagic labeling of G if f +(u) 6= f +(v) holds for any two adjacent vertices u and v of G, where E(u) is the set of edges incident to u and f +(u) = Pe2E(u) f (e). A graph G is called local antimagic if G admits at least one 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]) 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 1, la(G[H]) = (G) (H) if and only if (G) (H) = 2 (H) + d (kH) e, where 2k + 1 is the length of a shortest odd cycle in G.
Publication Details
Page(s) 76-83
Published Journal: Discrete Mathematics Letters, Volume: 11, Issue: 0, Year: 2023

Request the full text from PASTIC

Keywords
regular, local antimagic chromatic number, lexicographic product
0

Citations

0

Downloads

72

Views