G. Lau

activity

20122026

most citedApproaches Which Output Infinitely Many Graphs With Small Local Antimagic Chromatic Number

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

collaborators

Showing 2020 · math.COShow all

3 papers · 2 filters

math.CO2020★ 2 cited

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 $G = (V, E)$ is said to be local antimagic if it is a bijection $f : E \to {1, \dots, ∣ E ∣}$ such that for any pair of adjacent vertices $x$ and…

math.CO2020

On Local Antimagic Chromatic Number of Spider Graphs

Gee-Choon Lau, Wai-Chee Shiu, Chee-Xian Soo

An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f : E \to {1, ..., ∣ E ∣}$ such that for any pair of adjacent vertices $x$ …

math.CO2020

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 $G = (V, E)$ is said to be local antimagic if it is a bijection $f : E \to {1, \dots, ∣ E ∣}$ such that for any pair of adjacent vertices $x$ and…