activity
20122026
most citedComplete characterization of s-bridge graphs with local antimagic chromatic number 2

2 citations · 6 across the 21 of their papers we have counts for

collaborators
Showing math.COShow all

26 papers · 1 filter

math.CO2026

Necessary and sufficient conditions of a class of bipartite graphs with local antimagic chromatic number 2 - an algebraic approach

Gee-Choon Lau, Wai Chee Shiu

For a connected graph , a bijective edge labeling is a local antimagic labeling of if it induces a vertex labeling such that for an…

math.CO2026

A novel approach to determining chromatic number induced by labelings

Gee-Choon Lau, Wai Chee Shiu, Zhen Bin Gao

Given a simple graph of order and size , a bijection is a local total neighborhood antimagic labeling of if the induced…

math.CO2024

On local antimagic chromatic number of the join of two special families of graphs -- II

Gee-Choon Lau, Wai Chee Shiu

It is known that null graphs and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we proved that the join of 1-regular graph an…

math.CO2024

New Families of tripartite graphs with local antimagic chromatic number 3

Gee-Choon Lau, Wai Chee Shiu

For a graph of size , a bijection is a local antimagc labeling if it induces a vertex labeling such that $f^+(u) \ne f^…

math.CO2024

On local antimagic chromatic numbers of the join of two special families of graphs

Gee-Choon Lau, Wai Chee Shiu

It is known that null graphs and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we use matrices of size $(2m+1) \times (2k+1)…

math.CO2024

On local antimagic total chromatic number of certain one point union of graphs

Gee-Choon Lau

Let be a connected simple graph of order and size . A bijection is called a local antimagic total labeling of if for…