D. Bantva

activity

20182020

most citedA lower bound for the radio number of graphs

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

collaborators

6 papers

math.CO2020

Hamiltonian chromatic number of trees

Devsi Bantva, Samir Vaidya

Let $G$ be a simple finite connected graph of order $n$ . The detour distance between two distinct vertices $u$ and $v$ denoted by $D (u, v)$ is the length of a longest $uv$ -path in $…

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.CO2019

Hamiltonian chromatic number of block graphs

Devsi Bantva

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

math.CO2018

Radio number for middle graph of paths

Devsi Bantva

For a connected graph $G$ , let $d iam (G)$ and $d (u, v)$ denote the diameter of $G$ and distance between $u$ and $v$ in $G$ . A radio labeling of a graph $G$ is a mapping $φ: V(G) \rig…

math.CO2018

Further results on the radio number of trees

Devsi Bantva

Let $G$ be a finite, connected, undirected graph with diameter $d iam (G)$ and $d (u, v)$ denote the distance between $u$ and $v$ in $G$ . A radio labeling of a graph $G$ is a mapping $…

math.CO2018

On a lower bound for the eccentric connectivity index of graphs

Devsi Bantva

The eccentric connectivity index of a graph $G$ , denoted by $ξ^{c} (G)$ , defined as $ξ^{c} (G)$ = $\sum_{v \in V (G)} ε (v) \cdot d (v)$ , where $ε (v)$ and $d (v)$ denotes the eccentricity…