D. Bantva

activity

20162024

most citedRadio number for middle graph of paths

15 citations · 30 across the 17 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

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

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$ ,…

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…