G. Lau

activity

20122026

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

18 citations · 31 across the 29 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

An algorithmic approach in constructing infinitely many even size graphs with local antimagic chromatic number 3

Gee-Choon Lau

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

On bridge graphs with local antimagic chromatic number 3

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

Let $G = (V, E)$ be a connected graph. A bijection $f : E \to {1, \dots, ∣ E ∣}$ is called a local antimagic labeling if for any two adjacent vertices $x$ and $y$ , $f^{+} (x) \neq = f^{+} (y)$ …