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 math.COShow all

9 papers · 1 filter

math.CO2024

Forbidden induced subgraphs in iterative higher order line graphs

Aryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal

Let $G$ be a simple finite connected graph. The line graph $L (G)$ of graph $G$ is the graph whose vertices are the edges of $G$ , where $e f \in E (L (G))$ when $e \cap f \neq \emptyse…

math.CO2022

Radio Number for the Cartesian Product of Two Trees

Devsi Bantva, Daphne Der-Fen Liu

Let $G$ be a simple connected graph. For any two vertices $u$ and $v$ , let $d (u, v)$ denote the distance between $u$ and $v$ in $G$ , and let $d iam (G)$ denote the diameter of $G$ . A…

math.CO2021

Optimal Radio Labellings of Block Graphs and Line Graphs of Trees

Devsi Bantva, Daphne Der-Fen Liu

A radio labeling of a graph $G$ is a mapping $f$ : $V (G) \to {0, 1, 2, ...}$ such that $∣ f (u) - f (v) ∣ \geq d iam (G) + 1 - d (u, v)$ holds for every pair of vertices $u$ and $v$ …

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…