activity
20212024
most citedOn local antimagic chromatic number of cycle-related join graphs II

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

collaborators
Showing math.COShow all

7 papers · 1 filter

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

math.CO2024

Construction of local antimagic 3-colorable graphs of fixed even size -- matrix approach

Gee-Choon Lau, Wai Chee Shiu, M. Nalliah +1

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.CO2024

Constructions of local antimagic 3-colorable graphs of fixed odd size | matrix approach

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

An edge labeling of a connected graph is said to be local antimagic if there is a bijection such that for any pair of adjacent vertices

math.CO2023

On bridge graphs with local antimagic chromatic number 3

W. C. Shiu, G. C. Lau, R. X. Zhang

Let be a connected graph. A bijection is called a local antimagic labeling if for any two 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…