Zhen-Bin Gao
Research Subjects
Research Interests
Zhen-Bin Gao has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Ca 91784 1786 Plan Tree Drive Upland
2 shared publications- Gee-Choon Lau
77D, Jalan Suboh, 85000 Johor, Malaysia
2 shared publications Harris Kwong
2 shared publications- Ho-Kuen Ng
Department of Mathematics San José State University 95192 San José CA USA
2 shared publications NY 14063 Dept.\ Of Math.\ Sci. Suny Fredonia Fredonia
2 shared publicationsRicky Guo
2 shared publications
Latest Publications
- Open Access
- 30 June 2024
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 121 (1) , 41-52
On Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs
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
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 121 (1) , 41-52
Open AccessOn Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs
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.
- Open Access
- 30 June 2024
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 120 (1) , 399-410
On Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs
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
- Published by Combinatorial Press in Journal of Combinatorial Mathematics and Combinatorial Computing
- Vol. 120 (1) , 399-410
Open AccessOn Vertex-Euclidean Deficiency of Complete Fan Graphs and Complete Wheel Graphs
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
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 27 (6) , 1765-1783
On k-super graceful graphs with extremal maximum vertex degree
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.
- 1 January 2024
- Published by Taru Publications in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 27 (6) , 1765-1783
On k-super graceful graphs with extremal maximum vertex degree
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.
- 15 July 2022
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 38 (7) , 1185-1202
The Vertex Euclidean Properties of Graphs
- 15 July 2022
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 38 (7) , 1185-1202
The Vertex Euclidean Properties of Graphs
- Open Access
Further Results On k-Super Graceful Graphs
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.Open AccessFurther Results On k-Super Graceful Graphs
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.