D. Bantva

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 2024Show all

3 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.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…