Selvaraj Balachandran

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 22

Top Topics

Gravitational Search Algorithm

Bipartite Graph

Mutual Reinforcement

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Electron. J. Graph Theory Appl.

Publications

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) (2023)
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) (2023)
Palaniyappan Nithya, Suresh Elumalai, Selvaraj Balachandran, Sourav Mondal
Smallest ABS index of unicyclic graphs with given girth. J. Appl. Math. Comput. 69 (5) (2023)
Tomás Vetrík, Mesfin Masre, Selvaraj Balachandran
Eccentric connectivity coindex of bipartite graphs. Discret. Math. Algorithms Appl. 15 (1) (2023)
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 (2022)
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) (2022)
Kinkar Chandra Das, Suresh Elumalai, Selvaraj Balachandran
Open problems on the exponential vertex-degree-based topological indices of graphs. Discret. Appl. Math. 293 (2021)
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 (2021)
D. Sarala, S. K. Ayyaswamy, Selvaraj Balachandran, K. Kannan
A note on Steiner reciprocal degree distance. Discret. Math. Algorithms Appl. 12 (4) (2020)
Tomás Vetrík, Selvaraj Balachandran
General multiplicative Zagreb indices of trees and unicyclic graphs with given matching number. J. Comb. Optim. 40 (4) (2020)
Monther R. Alfuraidan, Tomás Vetrík, Selvaraj Balachandran
General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles. Symmetry 12 (4) (2020)
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) (2019)
Hanyuan Deng, Selvaraj Balachandran, Suresh Elumalai, Toufik Mansour
Harary index of bipartite graphs. Electron. J. Graph Theory Appl. 7 (2) (2019)
Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy
A Note on Harmonic Index and Coloring Number of a Graph. Ars Comb. 137 (2018)
Tomás Vetrík, Selvaraj Balachandran
General multiplicative Zagreb indices of trees. Discret. Appl. Math. 247 (2018)
Hanyuan Deng, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran
Extremal Properties of Some Topological Indices of Graphs. Ars Comb. 139 (2018)
Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan
On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs. Ars Comb. 130 (2017)
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 (2017)
Hanyuan Deng, D. Sarala, S. K. Ayyaswamy, Selvaraj Balachandran
The Zagreb indices of four operations on graphs. Appl. Math. Comput. 275 (2016)
Jianxi Li, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan
The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs. Ars Comb. 127 (2016)
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) (2016)
Hanyuan Deng, B. Krishnakumari, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran
Multiplicatively weighted Harary index of graphs. J. Comb. Optim. 30 (4) (2015)
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) (2013)