activity
20122024
most citedSome Results on incidence coloring, star arboricity and domination number

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

collaborators

7 papers

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…

math.CO20211 cited

On local antimagic chromatic number of cycle-related join graphs II

Gee-Choon Lau, K. Premalatha, S. Arumugam +1

An edge labeling of a graph is said to be local antimagic if it is a bijection such that for any pair of adjacent vertices and , $f^+…

math.CO2014

Sufficient spectral conditions on Hamiltonian and traceable graphs

Ruifang Liu, Wai Chee Shiu, Jie Xue

In this paper, we give sufficient conditions on the spectral radius for a bipartite graph to Hamiltonian and traceable, which expand the results of Lu, Liu and Tian (2012) [10]. Fu…