15 citations · 18 across the 4 of their papers we have counts for
5 papers
Approaches Which Output Infinitely Many Graphs With Small Local Antimagic Chromatic Number
Gee-Choon Lau, Jianxi Li, Ho-Kuen Ng +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…
On Local Antimagic Chromatic Number of Spider Graphs
Gee-Choon Lau, Wai-Chee Shiu, Chee-Xian Soo
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 …
On number of pendants in local antimagic chromatic number
Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng
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…
On the anti-Kelulé problem of cubic graphs
Qiuli Li, Wai Chee Shiu, Pak Kiu Sun +1
An edge set of a connected graph is called an anti-Kekulé set if is connected and has no perfect matchings, where denotes the subgraph obtained by deleting all…
A relation between Clar covering polynomial and cube polynomial
Heping Zhang, Wai-Chee Shiu, Pak-Kiu Sun
The Clar covering polynomial (also called Zhang-Zhang polynomial in some chemical literature) of a hexagonal system is a counting polynomial for some types of resonant structures c…