H. Naresh Kumar

Publication Activity (10 Years)

Years Active: 2019-2023
Publications (10 Years): 9

Top Topics

Undirected Graph

Minimum Spanning Trees

Strongly Connected

Top Venues

Discret. Math. Algorithms Appl.

RAIRO Oper. Res.

Int. J. Wavelets Multiresolution Inf. Process.

Publications

B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
Total outer connected vertex-edge domination. Discret. Math. Algorithms Appl. 15 (1) (2023)
B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan, S. P. Raja
On the computation of extremal trees of Harmonic index with given edge-vertex domination number. Int. J. Wavelets Multiresolution Inf. Process. 21 (5) (2023)
B. Senthilkumar, Mustapha Chellali, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
Graphs with unique minimum vertex-edge dominating sets. RAIRO Oper. Res. 57 (4) (2023)
B. Senthilkumar, Yanamandram B. Venkatakrishnan, H. Naresh Kumar
Super domination in trees. Discret. Math. Algorithms Appl. 14 (4) (2022)
H. Naresh Kumar, D. Pradhan, Yanamandram B. Venkatakrishnan
Double vertex-edge domination in graphs: complexity and algorithms. J. Appl. Math. Comput. 66 (1-2) (2021)
B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
A lower bound on the total vertex-edge domination number of a tree. Discret. Math. Algorithms Appl. 13 (1) (2021)
H. Naresh Kumar, Yanamandram B. Venkatakrishnan
On trees with domination number equal to edge-vertex roman domination number. Discret. Math. Algorithms Appl. 13 (4) (2021)
B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
Bounds on total edge domination number of a tree. Discret. Math. Algorithms Appl. 13 (2) (2021)
Yanamandram B. Venkatakrishnan, H. Naresh Kumar
On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs. WALCOM (2019)