On Hamiltonian Colorings of Trees. - Devsi Bantva (CALDAM, 2016)

On Hamiltonian Colorings of Block Graphs. - Devsi Bantva (WALCOM, 2016)

Radio number of trees. - Devsi Bantva; Samir Vaidya; Sanming Zhou (Discret. Appl. Math., 2017)

Further results on the radio number of trees. - Devsi Bantva (Electron. Notes Discret. Math., 2017)

Radio number for middle graph of paths. - Devsi Bantva (Electron. Notes Discret. Math., 2017)

Hamiltonian chromatic number of block graphs. - Devsi Bantva (J. Graph Algorithms Appl., 2017)

On a Lower Bound for the Eccentric Connectivity Index of Graphs. - Devsi Bantva (CALDAM, 2018)

A Lower Bound for the Radio Number of Graphs. - Devsi Bantva (CALDAM, 2019)

Hamiltonian chromatic number of trees. - Devsi Bantva; Samir Vaidya (CoRR, 2020)

Optimal radio labellings of block graphs and line graphs of trees. - Devsi Bantva; Daphne Der-Fen Liu (Theor. Comput. Sci., 2021)

Optimal radio labelings of graphs. - Devsi Bantva (CoRR, 2022)

A complete characterization of spectra of the Randic matrix of level-wise regular trees. - Punit Vadher; Devsi Bantva (CoRR, 2024)

Radio number for the Cartesian product of a tree and a complete graph. - Payal Vasoya; Devsi Bantva (CoRR, 2024)

Radio number for the Cartesian product of two trees. - Devsi Bantva; Daphne Der-Fen Liu (Discret. Appl. Math., 2024)

Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs. - Aryan Sanghi; Devsi Bantva; Sudebkumar Prasant Pal (CALDAM, 2025)

Radio labelling of two-branch trees. - Devsi Bantva; Samir Vaidya; Sanming Zhou (Appl. Math. Comput., 2025)

Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree. - Payal Vasoya; Devsi Bantva (Discret. Math. Algorithms Appl., 2025)