Gee-Choon Lau

Dr. Gee-Choon Lau

Universiti Teknologi MARA Johor Branch, Johor Bahru, Johor, Malaysia
orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 June 2020 in Graphs and Combinatorics
Verified
Journal Article
Closed access
PDF file
GLGee-Choon Lau
Gee-Choon Lau
HNHo-Kuen Ng
Ho-Kuen Ng
WSWai Chee Shiu
Wai Chee Shiu

1 February 2023 in Acta Mathematica Hungarica
Verified
Journal Article
Closed access
PDF file
GLGee-Choon Lau
Gee-Choon Lau
WSWai Chee Shiu
Wai Chee Shiu

2 February 2023 in Acta Mathematica Hungarica
Verified
Journal Article
Closed access
PDF file
GLGee-Choon Lau
Gee-Choon Lau
WSWai Chee Shiu
Wai Chee Shiu

1 January 2023 in Opuscula Mathematica
Verified
Journal Article
Closed access
GLGee-Choon Lau
Gee-Choon Lau
KSKarl Schaffer
Karl Schaffer
WSWai Chee Shiu
Wai Chee Shiu
Let \(G = (V,E)\) be a simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of \(G\) if for any two adjacent vertices \(u\) and \(v\), we have \(g^+(u) \neq g^+(v)\), where \(g^+(u) = \sum_{e\in E(u)} g(e)\), and \(E(u)\) is the set of edges incident to \(u\). Similarly, a bijection \(f:V(G)\cup E(G)\to \{1,2,\ldots,p+q\}\) is called a local antimagic total labeling of \(G\) if for any two adjacent vertices \(u\) and \(v\), we have \(w_f(u)\neq w_f(v)\), where \(w_f(u) = f(u) + \sum_{e\in E(u)} f(e)\). Thus, any local antimagic (total) labeling induces a proper vertex coloring of \(G\) if vertex \(v\) is assigned the color \(g^+(v)\) (respectively, \(w_f(u)\)). The local antimagic (total) chromatic number, denoted \(\chi_{la}(G)\) (respectively \(\chi_{lat}(G)\)), is the minimum number of induced colors taken over local antimagic (total) labeling of \(G\). We provide a short proof that every graph \(G\) is local antimagic total. The proof provides sharp upper bound to \(\chi_{lat}(G)\). We then determined the exact \(\chi_{lat}(G)\), where \(G\) is a complete bipartite graph, a path, or the Cartesian product of two cycles. Consequently, the \(\chi_{la}(G\vee K_1)\) is also obtained. Moreover, we determined the \(\chi_{la}(G\vee K_1)\) and hence the \(\chi_{lat}(G)\) for a class of 2-regular graphs \(G\) (possibly with a path). The work of this paper also provides many open problems on \(\chi_{lat}(G)\). We also conjecture that each graph \(G\) of order at least 3 has \(\chi_{lat}(G)\leq \chi_{la}(G)\).

18 April 2022 in Discrete Mathematics, Algorithms and Applications
Verified
Journal Article
Closed access
PDF file
GLGee-Choon Lau
Gee-Choon Lau
JLJianxi Li
Jianxi Li
WSWai-Chee Shiu
Wai-Chee Shiu

1 July 2020 in Malaya Journal of Matematik
Verified
Journal Article
Open access
PDF file
GLGee-Choon Lau
Gee-Choon Lau
HNHo-Kuen Ng
Ho-Kuen Ng
WSWai Chee Shiu
Wai Chee Shiu
A $(p, q, r)$-board that has $p q+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 \rightarrow[1, p q+p r+q r]$. Firstly, for $1 \leq i \leq 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 \leq j \leq 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 \leq k \leq 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 $\left\{x_i: 1 \leq i \leq p\right\}=\left\{c_1\right\}$ for some constant $c_1,\left\{y_j: 1 \leq j \leq q\right\}=\left\{c_2\right\}$ for some constant $c_2$, and $\left\{z_k: 1 \leq k \leq r\right\}=\left\{c_3\right\}$ 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.