Ho-Kuen Ng

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

18 citations · 23 across the 5 of their papers we have counts for

collaborators

8 papers

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 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…

math.CO2018★ 1 cited

On $k$ -Super Graceful Labeling of Graphs

Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng

Let $G = (V (G), E (G))$ be a simple, finite and undirected graph of order $p$ and size $q$ . For $k \geq 1$ , a bijection $f : V (G) \cup E (G) \to {k, k + 1, k + 2, \dots, k + p + q - 1}$ such that…

math.CO2018

Further Results On k-Super Graceful Graphs

Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng +2

math.CO2018★ 18 cited

On local antimagic chromatic number of cycle-related join graphs

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…

math.CO2018

Cartesian Magicness of 3-Dimensional Boards

Gee-Choon Lau, Ho-Kuen Ng, Wai-Chee Shiu

A $(p, q, r)$ -board that has $pq + p r + q r$ squares consists of a $(p, q)$ -, a $(p, r)$ -, and a $(q, r)$ -rectangle. Let $S$ be the set of the squares. Consider a bijection $f : S \to [1,pq+…

math.CO2018★ 2 cited

On local antimagic chromatic number of graphs with cut-vertices

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…

math.CO2018

Affirmative Solutions On Local Antimagic Chromatic Number

Gee-Choon Lau, Ho-Kuen Ng, Wai-Chee Shiu

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…

Approaches Which Output Infinitely Many Graphs With Small Local Antimagic Chromatic Number

On number of pendants in local antimagic chromatic number

On k-Super Graceful Labeling of Graphs

Further Results On k-Super Graceful Graphs

On local antimagic chromatic number of cycle-related join graphs

Cartesian Magicness of 3-Dimensional Boards

On local antimagic chromatic number of graphs with cut-vertices

Affirmative Solutions On Local Antimagic Chromatic Number

On $k$ -Super Graceful Labeling of Graphs