HNHo-Kuen Ng

Ho-Kuen Ng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ho-Kuen Ng has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • On k-super graceful graphs with extremal maximum vertex degree

    by Gee-Choon Lau, Wai Chee Shiu, Ho-Kuen Ng, Zhen-Bin Gao, Karl Schaffer

    Let (,)GVE be a simple and loopless graph with ||V vertices and ||E edges. For 1,k≥ a graph G is called k-super graceful if there is a bijective labeling :fVE∪→{|ikik≤≤+||V+||E−1} with ()fvu=|()()|fvfu− for every edge .vuE∈ In this paper, we study the existence of k-super graceful labeling of certain graphs with extremal maximum vertex degree.

  • Open Access

    On local antimagic chromatic number of graphs with cut-vertices

    by 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,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, the sharp lower bound of the local antimagic chromatic number of a graph with cut-vertices given by pendants is obtained. The exact value of the local antimagic chromatic number of many families of graphs with cut-vertices (possibly given by pendant edges) are also determined. Consequently, we partially answered Problem 3.1 in [Local antimagic vertex coloring of a graph, {\it Graphs and Combin.}, {\bf33} (2017), 275--285.].

  • On number of pendants in local antimagic chromatic number

    by 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 → {1, … ,|E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = ∑f(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. Let χ(G) be the chromatic number of G. In this paper, sharp upper and lower bounds of χla(G) for G with pendant vertices, and sufficient conditions for the bounds to equal, are obtained. Consequently, for k ≥ 1, there are infinitely many graphs with k ≥ χ(G) - 1 pendant vertices and χla(G) = k + 1. The work of this paper leads to conjecture and problem on graphs with pendant(s).


  • Open Access

    Further Results On k-Super Graceful Graphs

    by Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng, Zhen-Bin Gao, Karl Schaffer

    Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $p$ and size $q$. For $k\ge 1$, a bijection $f: V(G)\cup E(G) \to \{k, k+1, k+2, \ldots, k+p+q-1\}$ such that $f(uv)= |f(u) - f(v)|$ for every edge $uv\in E(G)$ is said to be a $k$-super graceful labeling of $G$. We say $G$ is $k$-super graceful if it admits a $k$-super graceful labeling. In this paper, we study the $k$-super gracefulness of some graphs in which each component is either regular or bi-regular.

  • Affirmative Solutions on Local Antimagic Chromatic Number

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


  • Open Access

    Affirmative Solutions On Local Antimagic Chromatic Number

    by 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,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, we give counterexamples to the lower bound of $\chi_{la}(G \vee O_2)$ that was obtained in [Local antimagic vertex coloring of a graph, Graphs and Combin., 33 : 275 - 285 (2017)]. A sharp lower bound of $\chi_{la}(G\vee O_n)$ and sufficient conditions for the given lower bound to be attained are obtained. Moreover, we settled Theorem 2.15 and solved Problem 3.3 in the affirmative. We also completely determined the local antimagic chromatic number of complete bipartite graphs.

  • Open Access

    On number of pendants in local antimagic chromatic number

    by 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,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. Let $\chi(G)$ be the chromatic number of $G$. In this paper, sharp upper and lower bounds of $\chi_{la}(G)$ for $G$ with pendant vertices, and sufficient conditions for the bounds to equal, are obtained. Consequently, for $k\ge 1$, there are infinitely many graphs with $k \ge \chi(G) - 1$ pendant vertices and $\chi_{la}(G) = k+1$. We conjecture that every tree $T_k$, other than certain caterpillars, spiders and lobsters, with $k\ge 1$ pendant vertices has $\chi_{la}(T_k) = k+1$.

  • Open Access

    On friendly index sets of k-galaxies

    by S-M Lee, Richard M Low, H K Ng, Y-C Wang

    On friendly index sets of k-galaxies

  • Open Access

    Cartesian Magicness of 3-Dimensional Boards

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

    A $(p,q,r)$-board that has $pq+pr+qr$ 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+pr+qr]$. Firstly, for $1 \le i \le p$, let $x_i$ be the sum of all the $q+r$ integers in the $i$-th row of the $(p,q+r)$-rectangle. Secondly, for $1 \le j \le q$, let $y_j$ be the sum of all the $p+r$ integers in the $j$-th row of the $(q,p+r)$-rectangle. Finally, for $1\le k\le r$, let $z_k$ be the the sum of all the $p+q$ integers in the $k$-th row of the $(r,p+q)$-rectangle. Such an assignment is called a $(p,q,r)$-design if $\{x_i : 1\le i\le p\}=\{c_1\}$ for some constant $c_1$, $\{y_j : 1\le j\le q\}=\{c_2\}$ for some constant $c_2$, and $\{z_k : 1\le k\le r\}=\{c_3\}$ for some constant $c_3$. A $(p,q,r)$-board that admits a $(p,q,r)$-design is called (1) Cartesian tri-magic if $c_1$, $c_2$ and $c_3$ are all distinct; (2) Cartesian bi-magic if $c_1$, $c_2$ and $c_3$ assume exactly 2 distinct values; (3) Cartesian magic if $c_1 = c_2 = c_3$ (which is equivalent to supermagic labeling of $K(p,q,r)$). Thus, Cartesian magicness is a generalization of magic rectangles into 3-dimensional space. In this paper, we study the Cartesian magicness of various $(p,q,r)$-board by matrix approach involving magic squares or rectangles. In Section~2, we obtained various sufficient conditions for $(p,q,r)$-boards to admit a Cartesian tri-magic design. In Sections~3 and~4, we obtained many necessary and (or) sufficient conditions for various $(p,q,r)$-boards to admit (or not admit) a Cartesian bi-magic and magic design. In particular, it is known that $K(p,p,p)$ is supermagic and thus every $(p,p,p)$-board is Cartesian magic. We gave a short and simpler proof that every $(p,p,p)$-board is Cartesian magic.

  • Open Access

    On local antimagic chromatic number of cycle-related join graphs

    by 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,\ldots ,|E|\}$ such that for any pair of adjacent vertices $x$ and $y$, $f^+(x)\not= f^+(y)$, where the induced vertex label $f^+(x)= \sum f(e)$, with $e$ ranging over all the edges incident to $x$. The local antimagic chromatic number of $G$, denoted by $\chi_{la}(G)$, is the minimum number of distinct induced vertex labels over all local antimagic labelings of $G$. In this paper, several sufficient conditions for $\chi_{la}(H)\le \chi_{la}(G)$ are obtained, where $H$ is obtained from $G$ with a certain edge deleted or added. We then determined the exact value of the local antimagic chromatic number of many cycle related join graphs.