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

18 papers

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

Radio number for the Cartesian product of a tree and a complete graph

Payal Vasoya, Devsi Bantva

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

math.CO2024

A complete characterization of spectra of the Randic matrix of level-wise regular trees

Punit Vadher, Devsi Bantva

Let $G$ be a simple finite connected graph with vertex set $V (G) = {v_{1}, v_{2}, \dots, v_{n}}$ . Denote the degree of vertex $v_{i}$ by $d_{i}$ for all $1 \leq i \leq n$ . The Randić matrix…

math.CO2023★ 1 cited

Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree

Payal Vasoya, Devsi Bantva

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

math.CO2023

Some techniques to find large lower bound trees for the radio number

Devsi Bantva, P L Vihol

For a simple finite connected graph $G$ , let $d iam (G)$ and $d_{G} (u, v)$ denote the diameter of $G$ and distance between $u$ and $v$ in $G$ , respectively. A radio labeling of a grap…

math.CO2022★ 1 cited

Optimal radio labelings of graphs

Devsi Bantva

Let $N$ be the set of positive integers. A radio labeling of a graph $G$ is a mapping $φ : V (G) \to N \cup {0}$ such that the inequality $|φ(u)-φ(v)| \ge…