Zhen-Bin Gao

collaborators

2 papers

math.CO2021

Graphs With Minimal Strength

Zhen-Bin Gao, Gee-Choon Lau, Wai-Chee Shiu

For any graph $G$ of order $p$ , a bijection $f : V (G) \to [1, p]$ is called a numbering of the graph $G$ of order $p$ . The strength $s t r_{f} (G)$ of a numbering $f : V (G) \to [1, p]$ of $G$ …

math.CO2018

Further Results On k-Super Graceful Graphs

Gee-Choon Lau, Wai-Chee Shiu, Ho-Kuen Ng +2

Let $G = (V (G), E (G))$ be a simple, finite and undirected graph of order $p$ and size $q$ . For $k \geq 1$ , a bijection $f : V (G) \cup E (G) \to {k, k + 1, k + 2, \dots, k + p + q - 1}$ such that…