18 citations · 31 across the 29 of their papers we have counts for
7 papers · 1 filter
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…
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^…
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)…
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…
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…
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 …
Complete characterization of graphs with local total antimagic chromatic number 3
G. C. Lau
A total labeling of a graph is said to be local total antimagic if it is a bijection such that adjacent vertices, adjacent edges,…