Sanming Zhou

activity

20162022

collaborators

5 papers

math.CO2022

Radio labelling of two-branch trees

Devsi Bantva, Samir Vaidya, Sanming Zhou

A radio labelling of a graph $G$ is a mapping $f : V (G) \to {0, 1, 2, \dots}$ such that $∣ f (u) - f (v) ∣ \geq d iam (G) + 1 - d (u, v)$ for every pair of distinct vertices $u, v$ …

math.CO2020

Distance-constrained labellings of Cartesian products of graphs

Anna Lladó, Hamid Mokhtar, Oriol Serra +1

An $L (h_{1}, h_{2}, \dots, h_{l})$ -labelling of a graph $G$ is a mapping $ϕ : V (G) \to {0, 1, 2, \dots}$ such that for $1 \leq i \leq l$ and each pair of vertices $u, v$ of $G$ at…

math.CO2017

The vertex-isoperimetric number of the incidence andnon-incidence graphs of unitals

Alice M. W. Hui, Muhammad Adib Surani, Sanming Zhou

We derive upper and lower bounds for the vertex-isoperimetric number of the incidence graphs of unitals and determine its order of magnitude. In the case when a unital contains suf…

math.CO2016

The isoperimetric number of the incidence graph of PG(n,q)

Andrew Elvey Price, Muhammad Adib Surani, Sanming Zhou

Let $Γ_{n, q}$ be the point-hyperplane incidence graph of the projective space $PG (n, q)$ , where $n \geq 2$ is an integer and $q$ a prime power. We determine the order…

math.CO2016

Radio number of trees

Devsi Bantva, Samir Vaidya, Sanming Zhou

A radio labeling of a graph $G$ is a mapping $f : V (G) \to {0, 1, 2, \dots}$ such that $∣ f (u) - f (v) ∣ \geq d + 1 - d (u, v)$ for every pair of distinct vertices $u, v$ of $G$ ,…