2 citations · 6 across the 11 of their papers we have counts for
17 papers
An algorithmic approach in constructing infinitely many even size graphs with local antimagic chromatic number 3
Gee-Choon Lau
An edge labeling of a connected graph is said to be local antimagic if it is a bijection such that for any pair of adjacent vertices and…
Complete characterization of s-bridge graphs with local antimagic chromatic number 2
Gee-Choon Lau, Wai-Chee Shiu, Ruixue Zhang +2
An edge labeling of a connected graph is said to be local antimagic if it is a bijection such that for any pair of adjacent vertices and…
On local antimagic chromatic number of lexicographic product graphs
Gee-Choon Lau, Wai-Chee Shiu
Let be a connected simple graph of order and size . A graph is called local antimagic if admits a local antimagic labeling. A bijection $f : E \to \{1,2,…
On local antimagic chromatic number of a corona product graph
Gee-Choon Lau, M. Nalliah
In this paper, we provide a correct proof for the lower bounds of the local antimagic chromatic number of the corona product of friendship and fan graphs with null graph respective…
On join product and local antimagic chromatic number of regular graphs
Gee-Choon Lau, Wai-Chee Shiu
Let be a connected simple graph of order and size . A graph is called local antimagic if admits a local antimagic labeling. A bijection $f : E \to \{1,2,…
On local antimagic total labeling of amalgamation graphs
Gee-Choon Lau, Wai-Chee Shiu
Let be a connected simple graph of order and size . A graph is called local antimagic (total) if admits a local antimagic (total) labeling. A bijection $…