Devsi Bantva

most citedA lower bound for the radio number of graphs

6 citations · 8 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2019★ 6 cited

A lower bound for the radio number of graphs

Devsi Bantva

A radio labeling of a graph $G$ is a mapping $\vp : V(G) \rightarrow \{0, 1, 2,...\}$ such that $|\vp(u)-\vp(v)|\geq \diam(G) + 1 - d(u,v)$ for every pair of distinct vertices $u,v…

math.CO2016★ 2 cited

On hamiltonian colorings of trees

Devsi Bantva

A hamiltonian coloring $c$ of a graph $G$ of order $n$ is a mapping $c$ : $V (G) \to {0, 1, 2, ...}$ such that $D (u, v)$ + $∣ c (u) - c (v) ∣$ $\geq$ $n - 1$ , for every two distinc…

math.CO2016

On hamiltonian colorings of block graphs

Devsi Bantva

A hamiltonian coloring c of a graph G of order p is an assignment of colors to the vertices of G such that $D (u, v) + ∣ c (u) - c (v) ∣ \geq p - 1$ for every two distinct vertices u and v of G…