H. Naresh Kumar

According to our database, H. Naresh Kumar authored at least 9 papers between 2019 and 2023.

Collaborative distances:

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

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

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

Double vertex-edge domination in graphs: complexity and algorithms.

H. Naresh Kumar, D. Pradhan, Yanamandram B. Venkatakrishnan

J. Appl. Math. Comput., June, 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

On trees with domination number equal to edge-vertex roman domination number.

H. Naresh Kumar, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., 2021

2019

On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs.

Yanamandram B. Venkatakrishnan, H. Naresh Kumar

Proceedings of the WALCOM: Algorithms and Computation - 13th International Conference, 2019