Follow
Naresh Kumar H
Naresh Kumar H
Assistant Professor(Mathematics), SASHE, SASTRA Deemed University, Thanjavur
Verified email at src.sastra.edu
Title
Cited by
Cited by
Year
On dynamic colouring of cartesian product of complete graph with some graphs
K Kaliraj, HN Kumar, JV Vivin
Journal of Taibah University for Science 14 (1), 168-171, 2020
102020
Double vertex-edge domination in graphs: complexity and algorithms
H Naresh Kumar, D Pradhan, YB Venkatakrishnan
Journal of Applied Mathematics and Computing 66 (1), 245-262, 2021
82021
On the algorithmic complexity of double vertex-edge domination in graphs
YB Venkatakrishnan, H Naresh Kumar
International Workshop on Algorithms and Computation, 188-198, 2018
72018
Super domination in trees
B Senthilkumar, YB Venkatakrishnan, HN Kumar
Discrete Mathematics, Algorithms and Applications 14 (04), 2150137, 2022
42022
VERTEX-EDGE ROMAN DOMINATION.
HN Kumar, YB Venkatakrishnan
Kragujevac Journal of Mathematics 45 (5), 2021
32021
On trees with domination number equal to edge-vertex roman domination number
H Naresh Kumar, YB Venkatakrishnan
Discrete Mathematics, Algorithms and Applications 13 (4), 2150045, 2021
32021
Domination and edge domination in trees
B Senthilkumar, YB Venkatakrishnan, KH Naresh
Ural Mathematical Journal 6 (1 (10)), 147-152, 2020
32020
Bounds on total edge domination number of a tree
B Senthilkumar, H Naresh Kumar, YB Venkatakrishnan
Discrete Mathematics, Algorithms and Applications 13 (02), 2150011, 2021
22021
A lower bound on the total vertex-edge domination number of a tree
B Senthilkumar, H Naresh Kumar, YB Venkatakrishnan
Discrete Mathematics, Algorithms and Applications 13 (01), 2050091, 2021
22021
On the computation of extremal trees of Harmonic index with given edge-vertex domination number
B Senthilkumar, HN Kumar, YB Venkatakrishnan, SP Raja
International Journal of Wavelets, Multiresolution and Information …, 2023
12023
Trees with vertex-edge roman domination number twice the domination number minus one
H Naresh Kumar, YB Venkatakrishnan
Proyecciones (Antofagasta) 39 (6), 1381-1392, 2020
12020
Bounds on the double edge-vertex domination number of a tree
YB Venkatakrishnan, HN Kumar, B Krishnakumari
Ars Combinatoria 146, 29-36, 2019
12019
Total domination and vertex-edge domination in tres
YB Venkatakrishnan, HN Kumar, C Natarajan
Proyecciones (Antofagasta) 38 (2), 295-304, 2019
12019
Algorithmic Aspects of Vertex-edge Domination in Some Graphs
HN Kumar, YB Venkatakrishnan
Ars Combinatoria 158, 19-26, 2024
2024
Modified Zagreb Index and Total Domination in Trees
H Naresh Kumar, B Senthilkumar, S Balachandran, YB Venkatakrishnan
Discrete Mathematics, Algorithms and Applications, 2024
2024
Algorithmic Aspects of Total Vertex-Edge Domination in Graphs
HN Kumar, M Chellali, YB Venkatakrishnan
International Journal of Foundations of Computer Science, 1-13, 2023
2023
Graphs with unique minimum edge-vertex dominating sets
B Senthilkumar, M Chellali, VB Yanamandram
Communications in Combinatorics and Optimization, 2023
2023
Graphs with unique minimum vertex-edge dominating sets
B Senthilkumar, M Chellali, HN Kumar, YB Venkatakrishnan
RAIRO-Operations Research 57 (4), 1785-1795, 2023
2023
Total outer connected vertex-edge domination
B Senthilkumar, HN Kumar, YB Venkatakrishnan
Discrete Mathematics, Algorithms and Applications, 2250057, 2023
2023
Vertices Belonging to all or to no Minimum Vertex-Edge Dominating Sets in Trees
HN Kumar, YB Venkatakrishnan
Vietnam Journal of Mathematics 49 (4), 1135-1140, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20