D. Bantva

collaborators

2 papers

math.CO2024

Radio labelling of two-branch trees

Devsi Bantva, Samir Vaidya, Sanming Zhou

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$ …

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…