default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDevsi Bantva
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Devsi Bantva
, Samir Vaidya, Sanming Zhou:
Radio labelling of two-branch trees. Appl. Math. Comput. 487: 129097 (2025)- 2024
- [j7]Devsi Bantva, Daphne Der-Fen Liu:
Radio number for the Cartesian product of two trees. Discret. Appl. Math. 342: 304-316 (2024) - [i10]Punit Vadher, Devsi Bantva:
A complete characterization of spectra of the Randic matrix of level-wise regular trees. CoRR abs/2401.02078 (2024) - [i9]Payal Vasoya, Devsi Bantva:
Radio number for the Cartesian product of a tree and a complete graph. CoRR abs/2404.08400 (2024) - [i8]Aryan Sanghi, Devsi Bantva, Sudebkumar Prasant Pal:
Forbidden induced subgraphs in iterative higher order line graphs. CoRR abs/2410.04607 (2024) - 2023
- [i7]Payal Vasoya, Devsi Bantva:
Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree. CoRR abs/2304.10094 (2023) - 2022
- [i6]Devsi Bantva, Samir Vaidya, Sanming Zhou:
Radio labelling of two-branch trees. CoRR abs/2201.12582 (2022) - [i5]Devsi Bantva, Daphne Der-Fen Liu:
Radio Number for the Cartesian Product of Two Trees. CoRR abs/2202.13983 (2022) - [i4]Devsi Bantva:
Optimal radio labelings of graphs. CoRR abs/2212.13578 (2022) - 2021
- [j6]Devsi Bantva, Daphne Der-Fen Liu:
Optimal radio labellings of block graphs and line graphs of trees. Theor. Comput. Sci. 891: 90-104 (2021) - [i3]Devsi Bantva, Daphne Der-Fen Liu:
Optimal Radio Labellings of Block Graphs and Line Graphs of Trees. CoRR abs/2108.12754 (2021) - 2020
- [i2]Devsi Bantva, Samir Vaidya:
Hamiltonian chromatic number of trees. CoRR abs/2012.07375 (2020)
2010 – 2019
- 2019
- [c4]Devsi Bantva:
A Lower Bound for the Radio Number of Graphs. CALDAM 2019: 161-173 - [i1]Devsi Bantva:
Hamiltonian chromatic number of block graphs. CoRR abs/1901.05839 (2019) - 2018
- [c3]Devsi Bantva:
On a Lower Bound for the Eccentric Connectivity Index of Graphs. CALDAM 2018: 179-187 - 2017
- [j5]Devsi Bantva, Samir Vaidya, Sanming Zhou:
Radio number of trees. Discret. Appl. Math. 217: 110-122 (2017) - [j4]Devsi Bantva:
Further results on the radio number of trees. Electron. Notes Discret. Math. 63: 85-91 (2017) - [j3]Devsi Bantva:
Radio number for middle graph of paths. Electron. Notes Discret. Math. 63: 93-100 (2017) - [j2]Devsi Bantva:
Hamiltonian chromatic number of block graphs. J. Graph Algorithms Appl. 21(3): 353-369 (2017) - 2016
- [c2]Devsi Bantva:
On Hamiltonian Colorings of Trees. CALDAM 2016: 49-60 - [c1]Devsi Bantva:
On Hamiltonian Colorings of Block Graphs. WALCOM 2016: 28-39 - 2015
- [j1]Devsi Bantva, Samir Vaidya, Sanming Zhou:
Radio number of trees. Electron. Notes Discret. Math. 48: 135-141 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
