default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSelvaraj Balachandran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j23]Venkatesan Maitreyi, Suresh Elumalai, Selvaraj Balachandran, Hechao Liu
:
The minimum Sombor index of trees with given number of pendant vertices. Comput. Appl. Math. 42(8): 331 (2023)- [j22]Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran:
Eccentric connectivity coindex of bipartite graphs. Discret. Math. Algorithms Appl. 15(1): 2250054:1-2250054:11 (2023) - [j21]Palaniyappan Nithya, Suresh Elumalai, Selvaraj Balachandran, Sourav Mondal:
Smallest ABS index of unicyclic graphs with given girth. J. Appl. Math. Comput. 69(5): 3675-3692 (2023) - [j20]Kannan Aarthi, Suresh Elumalai, Selvaraj Balachandran, Sourav Mondal:
Extremal values of the atom-bond sum-connectivity index in bicyclic graphs. J. Appl. Math. Comput. 69(6): 4269-4285 (2023) - 2022
- [j19]Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomás Vetrík, Selvaraj Balachandran:
General Randić index of unicyclic graphs with given diameter. Discret. Appl. Math. 306: 7-16 (2022) - [j18]Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran:
Zeroth-order general Randić index of trees with given distance k-domination number. Electron. J. Graph Theory Appl. 10(1): 247 (2022) - 2021
- [j17]Kinkar Chandra Das, Suresh Elumalai, Selvaraj Balachandran:
Open problems on the exponential vertex-degree-based topological indices of graphs. Discret. Appl. Math. 293: 38-49 (2021) - [j16]Monther Rashed Alfuraidan, Kinkar Chandra Das, Tomás Vetrík, Selvaraj Balachandran:
General sum-connectivity index of unicyclic graphs with given diameter. Discret. Appl. Math. 295: 39-46 (2021) - 2020
- [j15]D. Sarala, S. K. Ayyaswamy, Selvaraj Balachandran, K. Kannan:
A note on Steiner reciprocal degree distance. Discret. Math. Algorithms Appl. 12(4): 2050050:1-2050050:13 (2020) - [j14]Tomás Vetrík, Selvaraj Balachandran:
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number. J. Comb. Optim. 40(4): 953-973 (2020) - [j13]Monther R. Alfuraidan, Tomás Vetrík, Selvaraj Balachandran:
General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles. Symmetry 12(4): 514 (2020) - 2019
- [j12]Hanyuan Deng, Selvaraj Balachandran, Suresh Elumalai:
Some tight bounds for the harmonic index and the variation of the Randić index of graphs. Discret. Math. 342(7): 2060-2065 (2019) - [j11]Hanyuan Deng, Selvaraj Balachandran, Suresh Elumalai, Toufik Mansour:
Harary index of bipartite graphs. Electron. J. Graph Theory Appl. 7(2): 365-372 (2019) - 2018
- [j10]Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy:
A Note on Harmonic Index and Coloring Number of a Graph. Ars Comb. 137: 257-262 (2018) - [j9]Hanyuan Deng, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran:
Extremal Properties of Some Topological Indices of Graphs. Ars Comb. 139: 327-336 (2018) - [j8]Tomás Vetrík, Selvaraj Balachandran:
General multiplicative Zagreb indices of trees. Discret. Appl. Math. 247: 341-351 (2018) - 2017
- [j7]D. Sarala, Hanyuan Deng, S. K. Ayyaswamy, Selvaraj Balachandran:
The Zagreb indices of graphs based on four new operations related to the lexicographic product. Appl. Math. Comput. 309: 156-169 (2017) - [j6]Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan:
On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs. Ars Comb. 130: 239-248 (2017) - 2016
- [j5]Hanyuan Deng, D. Sarala, S. K. Ayyaswamy, Selvaraj Balachandran:
The Zagreb indices of four operations on graphs. Appl. Math. Comput. 275: 422-431 (2016) - [j4]Jianxi Li, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan:
The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs. Ars Comb. 127: 409-419 (2016) - [j3]S. Raja Balachandar, K. Kannan, R. Srikanth, Selvaraj Balachandran, S. G. Venkatesh, K. Balasubramanian:
Gravitational search algorithm based solution for a class of ternary diophantine equations. J. Comput. Methods Sci. Eng. 16(4): 899-911 (2016) - 2015
- [j2]Hanyuan Deng, B. Krishnakumari, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran:
Multiplicatively weighted Harary index of graphs. J. Comb. Optim. 30(4): 1125-1137 (2015) - 2013
- [j1]Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan:
On the harmonic index and the chromatic number of a graph. Discret. Appl. Math. 161(16-17): 2740-2744 (2013)
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 2024-10-07 22:24 CEST 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:
