D. Bantva

activity

20182024

most citedA lower bound for the radio number of graphs

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

collaborators

Showing 2018Show all

3 papers · 1 filter

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…