Gee-Choon Lau
Research Subjects
Gee-Choon Lau has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Wai Chee Shiu
Department of Mathematics, The Chinese University of Hong Kong, Shatin, Hong Kong, China
35 shared publications - Ho-Kuen Ng
Department of Mathematics San José State University 95192 San José CA USA
10 shared publications Wai Chee Shiu
Department of Mathematics, The Chinese University of Hong Kong Shatin, Hong Kong, P.R. China
6 shared publicationsSin-Min Lee
34803, Hollyhock Street, Union City, CA 94587, U.S.A
5 shared publications- K. Premalatha
Department of Mathematics Sri Shakthi Institute of Engineering and Technology 641062 Coimbatore Tamil Nadu India
4 shared publications - Pon Jeyanthi
Department of Mathematics, Govindammal Aditanar College for Women, Tiruchendur 628215, Tamilnadu, India
4 shared publications
Latest Publications
- Open Access
- 12 August 2026
- Published by Combinatorial Press in Utilitas Mathematica
- Vol. 128, 427-439
Edge \(k\)-product cordial labeling of complete bipartite graph \(K_{2,2n}\)Recently, it was proved that if \(K_{2,2n}\) admits an edge \(k\)-product cordial labeling, then either \(k=2n+1\) or \(k\ge 4n+1\), and two related existence problems were posed. In this paper, we prove that \(K_{2,2n}\) is edge \((2n+1)\)-product cordial if and only if \(2n+1\) is a prime. We further show that \(K_{2,4}\) is edge \(k\)-product cordial if and only if \(k=5\) or \(k\ge 9\), while \(K_{2,6}\) is edge \(k\)-product cordial if and only if \(k=7\) or \(k\ge 13\). These results completely answer one of the posed questions and provide further evidence for a general existence conjecture.- 12 August 2026
- Published by Combinatorial Press in Utilitas Mathematica
- Vol. 128, 427-439
Open AccessEdge \(k\)-product cordial labeling of complete bipartite graph \(K_{2,2n}\)Recently, it was proved that if \(K_{2,2n}\) admits an edge \(k\)-product cordial labeling, then either \(k=2n+1\) or \(k\ge 4n+1\), and two related existence problems were posed. In this paper, we prove that \(K_{2,2n}\) is edge \((2n+1)\)-product cordial if and only if \(2n+1\) is a prime. We further show that \(K_{2,4}\) is edge \(k\)-product cordial if and only if \(k=5\) or \(k\ge 9\), while \(K_{2,6}\) is edge \(k\)-product cordial if and only if \(k=7\) or \(k\ge 13\). These results completely answer one of the posed questions and provide further evidence for a general existence conjecture. - Open Access
- 22 July 2026
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 131, 237-251
Invalid proofs in “edge k-product cordial labeling of graphs” and their revision
This paper identifies and corrects invalid arguments in [Edge k-Product Cordial Labeling of Graphs, Eur. J. Pure Appl. Math., 18(2), Article No. 5887 (2025)]. In particular, several published statements are shown to be false through explicit counterexamples. Revised versions of these results are established under appropriate conditions, often involving structural properties such as girth. Correct bounds or conditions are obtained for specific graph classes, including shadow graphs, splitting graphs of stars, and path unions of cycles. These corrections clarify the limitations of the earlier claims and provide a more accurate foundation for further study of edge k-product cordial labeling.
- 22 July 2026
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 131, 237-251
Open AccessInvalid proofs in “edge k-product cordial labeling of graphs” and their revision
This paper identifies and corrects invalid arguments in [Edge k-Product Cordial Labeling of Graphs, Eur. J. Pure Appl. Math., 18(2), Article No. 5887 (2025)]. In particular, several published statements are shown to be false through explicit counterexamples. Revised versions of these results are established under appropriate conditions, often involving structural properties such as girth. Correct bounds or conditions are obtained for specific graph classes, including shadow graphs, splitting graphs of stars, and path unions of cycles. These corrections clarify the limitations of the earlier claims and provide a more accurate foundation for further study of edge k-product cordial labeling.
- Open Access
- 5 January 2026
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 288-313
On (a, d)-Total Neighborhood-Antimagic Labelings
Suppose G = (V, E) is a graph of p vertices and q edges. Let f : V ∪E → {1, 2, . . . , p+q} be a bijection such that WT(u) = Σ[ f (ux)+ f (x)] (over every neighbor x of u) is the total weight of vertex u induced by f. We say G is (a, d)-total neighborhood-antimagic if all the total weights form an arithmetic progression with first term a and common difference d. In this paper, we obtain many necessary and sufficient conditions for 1- and 2-regular graphs, and the one point union of such graphs to admit (a, d)-total neighborhood-antimagic labeling.
- 5 January 2026
- Published by Universal Wiser Publisher Pte. Ltd in Contemporary Mathematics
- p. 288-313
Open AccessOn (a, d)-Total Neighborhood-Antimagic Labelings
Suppose G = (V, E) is a graph of p vertices and q edges. Let f : V ∪E → {1, 2, . . . , p+q} be a bijection such that WT(u) = Σ[ f (ux)+ f (x)] (over every neighbor x of u) is the total weight of vertex u induced by f. We say G is (a, d)-total neighborhood-antimagic if all the total weights form an arithmetic progression with first term a and common difference d. In this paper, we obtain many necessary and sufficient conditions for 1- and 2-regular graphs, and the one point union of such graphs to admit (a, d)-total neighborhood-antimagic labeling.
- Open Access
- 28 September 2025
- Published by Combinatorial Press in Utilitas Mathematica
- Vol. 124, 189-206
On local antimagic chromatic number of the join of two special families of graphs | II
Null graphs (respectively, 1-regular graphs) are the only regular graphs with local antimagic chromatic number 1 (respectively, undefined). In this paper, we proved that the join of 1-regular graph and a null graph has local antimagic chromatic number 3. As a by-product, we also obtained many families of (possibly disconnected or regular) bipartite and tripartite graph with local antimagic chromatic number 3.
- 28 September 2025
- Published by Combinatorial Press in Utilitas Mathematica
- Vol. 124, 189-206
Open AccessOn local antimagic chromatic number of the join of two special families of graphs | II
Null graphs (respectively, 1-regular graphs) are the only regular graphs with local antimagic chromatic number 1 (respectively, undefined). In this paper, we proved that the join of 1-regular graph and a null graph has local antimagic chromatic number 3. As a by-product, we also obtained many families of (possibly disconnected or regular) bipartite and tripartite graph with local antimagic chromatic number 3.
- Open Access
- 24 August 2025
- Published by Combinatorial Press in Congressus Numerantium
- Vol. 236, 15-39
On local antimagic chromatic numbers of the join of two special families of graphs
It is known that null graphs are the only (regular) graphs with local antimagic chromatic 1 and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we first use matrices of size \((2m+1) \times (2k+1)\) to completely determine the local antimagic chromatic number of the join of null graphs \(O_m\) and 1-regular graphs \((2k+1)P_2\) for all \(k\ge 1, m\ge 2\). We then make use of other matrices of same size to obtain the local antimagic chromatic number of another family of tripartite graphs. Consequently, we obtained infinitely many (possibly disconnected) regular tripartite graphs with local antimagic chromatic number 3.- 24 August 2025
- Published by Combinatorial Press in Congressus Numerantium
- Vol. 236, 15-39
Open AccessOn local antimagic chromatic numbers of the join of two special families of graphs
It is known that null graphs are the only (regular) graphs with local antimagic chromatic 1 and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we first use matrices of size \((2m+1) \times (2k+1)\) to completely determine the local antimagic chromatic number of the join of null graphs \(O_m\) and 1-regular graphs \((2k+1)P_2\) for all \(k\ge 1, m\ge 2\). We then make use of other matrices of same size to obtain the local antimagic chromatic number of another family of tripartite graphs. Consequently, we obtained infinitely many (possibly disconnected) regular tripartite graphs with local antimagic chromatic number 3. - Open Access
- 30 March 2025
- Published by Combinatorial Press in Ars Combinatoria
- Vol. 162, 71-81
New families of tripartite graphs with local antimagic chromatic number 3
For a graph \(G=(V,E)\) of size \(q\), a bijection \(f : E \to \{1,2,\ldots,q\}\) is a local antimagic labeling if it induces a vertex labeling \(f^+ : V \to \mathbb{N}\) such that \(f^+(u) \ne f^+(v)\), where \(f^+(u)\) is the sum of all the incident edge label(s) of \(u\), for every edge \(uv \in E(G)\). In this paper, we make use of matrices of fixed sizes to construct several families of infinitely many tripartite graphs with local antimagic chromatic number 3.- 30 March 2025
- Published by Combinatorial Press in Ars Combinatoria
- Vol. 162, 71-81
Open AccessNew families of tripartite graphs with local antimagic chromatic number 3
For a graph \(G=(V,E)\) of size \(q\), a bijection \(f : E \to \{1,2,\ldots,q\}\) is a local antimagic labeling if it induces a vertex labeling \(f^+ : V \to \mathbb{N}\) such that \(f^+(u) \ne f^+(v)\), where \(f^+(u)\) is the sum of all the incident edge label(s) of \(u\), for every edge \(uv \in E(G)\). In this paper, we make use of matrices of fixed sizes to construct several families of infinitely many tripartite graphs with local antimagic chromatic number 3. - 1 January 2025
- Published by AGH University Press in Opuscula Mathematica
- Vol. 45 (2) , 199-225
Complete characterization of graphs with local total antimagic chromatic number 3
A total labeling of a graph \(G = (V, E)\) is said to be local total antimagic if it is a bijection \(f: V\cup E \to\{1,\ldots,|V|+|E|\}\) such that adjacent vertices, adjacent edges, and pairs of an incident vertex and edge have distinct induced weights where the induced weight of a vertex \(v\) is \(w_f(v) = \sum f(e)\) with \(e\) ranging over all the edges incident to \(v\), and the induced weight of an edge \(uv\) is \(w_f(uv) = f(u) + f(v)\). The local total antimagic chromatic number of \(G\), denoted by \(\chi_{lt}(G)\), is the minimum number of distinct induced vertex and edge weights over all local total antimagic labelings of \(G\). In this paper, we first obtain general lower and upper bounds for \(\chi_{lt}(G)\) and sufficient conditions to construct a graph \(H\) with \(k\) pendant edges and \(\chi_{lt}(H) \in\{\Delta(H)+1, k+1\}\). We then completely characterize graphs \(G\) with \(\chi_{lt}(G)=3\). Many families of (disconnected) graphs \(H\) with \(k\) pendant edges and \(\chi_{lt}(H) \in\{\Delta(H)+1, k+1\}\) are also obtained.- 1 January 2025
- Published by AGH University Press in Opuscula Mathematica
- Vol. 45 (2) , 199-225
Complete characterization of graphs with local total antimagic chromatic number 3
A total labeling of a graph \(G = (V, E)\) is said to be local total antimagic if it is a bijection \(f: V\cup E \to\{1,\ldots,|V|+|E|\}\) such that adjacent vertices, adjacent edges, and pairs of an incident vertex and edge have distinct induced weights where the induced weight of a vertex \(v\) is \(w_f(v) = \sum f(e)\) with \(e\) ranging over all the edges incident to \(v\), and the induced weight of an edge \(uv\) is \(w_f(uv) = f(u) + f(v)\). The local total antimagic chromatic number of \(G\), denoted by \(\chi_{lt}(G)\), is the minimum number of distinct induced vertex and edge weights over all local total antimagic labelings of \(G\). In this paper, we first obtain general lower and upper bounds for \(\chi_{lt}(G)\) and sufficient conditions to construct a graph \(H\) with \(k\) pendant edges and \(\chi_{lt}(H) \in\{\Delta(H)+1, k+1\}\). We then completely characterize graphs \(G\) with \(\chi_{lt}(G)=3\). Many families of (disconnected) graphs \(H\) with \(k\) pendant edges and \(\chi_{lt}(H) \in\{\Delta(H)+1, k+1\}\) are also obtained.- Open Access
- 25 December 2024
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 16
On Bridge Graphs with Local Antimagic Chromatic Number 3
Let be a connected graph. A bijection is called a local antimagic labeling if, for any two adjacent vertices x and y, , where , and is the set of edges incident to x. Thus, a local antimagic labeling induces a proper vertex coloring of G, where the vertex x is assigned the color . The local antimagic chromatic number is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, we present some families of bridge graphs with and give several ways to construct bridge graphs with .- 25 December 2024
- Published by MDPI AG in Mathematics
- Vol. 13 (1) , 16
Open AccessOn Bridge Graphs with Local Antimagic Chromatic Number 3
Let be a connected graph. A bijection is called a local antimagic labeling if, for any two adjacent vertices x and y, , where , and is the set of edges incident to x. Thus, a local antimagic labeling induces a proper vertex coloring of G, where the vertex x is assigned the color . The local antimagic chromatic number is the minimum number of colors taken over all colorings induced by local antimagic labelings of G. In this paper, we present some families of bridge graphs with and give several ways to construct bridge graphs with . - Open Access
On local antimagic chromatic number of the join of two special families of graphs -- II
It is known that null graphs and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we proved that the join of 1-regular graph and a null graph has local antimagic chromatic number is 3. Consequently, we also obtained many families of (possibly disconnected or regular) bipartite and tripartite graph with local antimagic chromatic number 3.
Open AccessOn local antimagic chromatic number of the join of two special families of graphs -- II
It is known that null graphs and 1-regular graphs are the only regular graphs without local antimagic chromatic number. In this paper, we proved that the join of 1-regular graph and a null graph has local antimagic chromatic number is 3. Consequently, we also obtained many families of (possibly disconnected or regular) bipartite and tripartite graph with local antimagic chromatic number 3.
- 25 September 2024
- Published by Udmurt State University in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
- Vol. 34 (3) , 375-396
Complete characterization of bridge graphs with local antimagic chromatic number 2
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f\colon 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 characterize $s$-bridge graphs with local antimagic chromatic number 2.- 25 September 2024
- Published by Udmurt State University in Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
- Vol. 34 (3) , 375-396
Complete characterization of bridge graphs with local antimagic chromatic number 2
An edge labeling of a connected graph $G = (V, E)$ is said to be local antimagic if it is a bijection $f\colon 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 characterize $s$-bridge graphs with local antimagic chromatic number 2.