Zhen Bin Gao

Dr. Zhen Bin Gao


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
15 July 2022 in Acta Mathematica Sinica, English Series
Verified
Journal Article
Closed access
PDF file
ZGZhen Bin Gao
Zhen Bin Gao
MWMeng Wang
Meng Wang
SLSin Min Lee
Sin Min Lee
HKHarris Kwong
Harris Kwong
SWShujuan Wang
Shujuan Wang

30 June 2024 in Journal of Combinatorial Mathematics and Combinatorial Computing
Verified
Journal Article
Open access
ZGZhen Bin Gao
Zhen Bin Gao
RGRicky Guo
Ricky Guo
HKHarris Kwong
Harris Kwong
SLSin-Min Lee
Sin-Min Lee
WQWei Qiu
Wei Qiu
CUCa 91784 1786 Plan Tree Drive Upland
Ca 91784 1786 Plan Tree Drive Upland
A simple graph G with p vertices is said to be vertex-Euclidean if there exists a bijection f : V ( G ) → { 1 , 2 , … , p } such that f ( v 1 ) + f ( v 2 ) > f ( v 3 ) for each C 3 -subgraph with vertex set { v 1 , v 2 , v 3 } , where f ( v 1 ) < f ( v 2 ) < f ( v 3 ) . More generally, the vertex-Euclidean deficiency of a graph G is the smallest integer k such that G ∪ N k is vertex-Euclidean. To illustrate the idea behind this new graph labeling problem, we study the vertex-Euclidean deficiency of two new families of graphs called the complete fan graphs and the complete wheel graphs. We also explore some related problems, and pose several research topics for further study.

30 June 2024 in Journal of Combinatorial Mathematics and Combinatorial Computing
Verified
Journal Article
Open access
ZGZhen Bin Gao
Zhen Bin Gao
RGRicky Guo
Ricky Guo
HKHarris Kwong
Harris Kwong
SLSin-Min Lee
Sin-Min Lee
WQWei Qiu
Wei Qiu
CUCa 91784 1786 Plan Tree Drive Upland
Ca 91784 1786 Plan Tree Drive Upland
A simple graph G with p vertices is said to be vertex-Euclidean if there exists a bijection f : V ( G ) → { 1 , 2 , … , p } such that f ( v 1 ) + f ( v 2 ) > f ( v 3 ) for each C 3 -subgraph with vertex set { v 1 , v 2 , v 3 } , where f ( v 1 ) < f ( v 2 ) < f ( v 3 ) . More generally, the vertex-Euclidean deficiency of a graph G is the smallest integer k such that G ∪ N k is vertex-Euclidean. To illustrate the idea behind this new graph labeling problem, we study the vertex-Euclidean deficiency of two new families of graphs called the complete fan graphs and the complete wheel graphs. We also explore some related problems, and pose several research topics for further study.

1 January 2024 in Journal of Discrete Mathematical Sciences and Cryptography
Verified
Journal Article
Closed access
GLGee-Choon Lau
Gee-Choon Lau
WSWai Chee Shiu
Wai Chee Shiu
HNHo-Kuen Ng
Ho-Kuen Ng
ZGZhen Bin Gao
Zhen Bin Gao
KSKarl Schaffer
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.

3 April 2021 in arXiv
Verified
Preprint
Open access
PDF file
GLGee-Choon Lau
Gee-Choon Lau
WSWai Chee Shiu
Wai Chee Shiu
HNHo-Kuen Ng
Ho-Kuen Ng
ZGZhen Bin Gao
Zhen Bin Gao
KSKarl Schaffer
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.