B. Senthilkumar

According to our database, B. Senthilkumar authored at least 9 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

First Zagreb index and edge-vertex domination in trees.

H. Naresh Kumar, B. Senthilkumar, S. Balachandran, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., April, 2025

Modified Zagreb index and total domination in trees.

H. Naresh Kumar, B. Senthilkumar, S. Balachandran, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., February, 2025

2023

On the computation of extremal trees of Harmonic index with given edge-vertex domination number.

B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan, S. P. Raja

Int. J. Wavelets Multiresolution Inf. Process., September, 2023

A Novel Multilevel DC-DC Flyback Converter-Fed H-Bridge Inverter.

Vijayalakshmi Subramanian, Marimuthu Marikannu, B. Senthilkumar, J. Reka, P. Rathe Devi, Venugopal Ramadoss

J. Circuits Syst. Comput., August, 2023

Graphs with unique minimum vertex-edge dominating sets.

B. Senthilkumar, Mustapha Chellali, H. Naresh Kumar, Yanamandram B. Venkatakrishnan

RAIRO Oper. Res., July, 2023

Total outer connected vertex-edge domination.

B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., January, 2023

2022

Super domination in trees.

B. Senthilkumar, Yanamandram B. Venkatakrishnan, H. Naresh Kumar

Discret. Math. Algorithms Appl., 2022

2021

Bounds on total edge domination number of a tree.

B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., 2021

A lower bound on the total vertex-edge domination number of a tree.

B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., 2021