activity
20182024
most citedA lower bound for the radio number of graphs

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

collaborators
Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 6 cited

A lower bound for the radio number of graphs

Devsi Bantva

A radio labeling of a graph 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.CO2019

Hamiltonian chromatic number of block graphs

Devsi Bantva

Let be a simple connected graph of order . A hamiltonian coloring of a graph is an assignment of colors (non-negative integers) to the vertices of such that $D(u…