activity
20122026
most citedApproaches Which Output Infinitely Many Graphs With Small Local Antimagic Chromatic Number

2 citations · 7 across the 24 of their papers we have counts for

collaborators
Showing 2022 · math.COShow all

7 papers · 2 filters

math.CO2022★ 2 cited

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…

math.CO2022

A note on local antimagic chromatic number of lexicographic product graphs

Gee-Choon Lau, Wai-Chee Shiu, K. Premalatha +2

Let be a connected simple graph. A bijection is called a local antimagic labeling of if holds for any two…

math.CO2022

Sudoku Number of Graphs

Gee-Choon Lau, J. Maria Jeyaseeli, Wai-Chee Shiu +1

We introduce a new concept in graph coloring motivated by the popular Sudoku puzzle. Let be a graph of order with chromatic number and let Le…

math.CO2022

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,…

math.CO2022

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…

math.CO2022

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,…