H. Naresh Kumar

14 papers B 1Journal 12Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	First Zagreb index and edge-vertex domination in trees. Discret. Math. Algorithms Appl. H. Naresh Kumar, B. Senthilkumar, S. Balachandran, Yanamandram B. Venkatakrishnan
2025	J	`jnl`	Modified Zagreb index and total domination in trees. Discret. Math. Algorithms Appl. H. Naresh Kumar, B. Senthilkumar, S. Balachandran, Yanamandram B. Venkatakrishnan
2024	J	`jnl`	Algorithmic Aspects of Total Vertex-Edge Domination in Graphs. Int. J. Found. Comput. Sci. H. Naresh Kumar, Mustapha Chellali, Yanamandram B. Venkatakrishnan
2024	J	`jnl`	Algorithmic Aspects of Vertex-edge Domination in Some Graphs. Ars Comb. H. Naresh Kumar, Yanamandram B. Venkatakrishnan
2024	—	`conf`	Augmenting Security in Edge Devices: FPGA-Based Enhanced LEA Algorithm with S-Box and Chaotic Functions. ATIS B. Sri Yugenther, Anila Glory H., H. Naresh Kumar, R. Sivaraman, V. S. Shankar Sriram
2023	J	`jnl`	Graphs with unique minimum vertex-edge dominating sets. RAIRO Oper. Res. B. Senthilkumar, Mustapha Chellali, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
2023	J	`jnl`	On the computation of extremal trees of Harmonic index with given edge-vertex domination number. Int. J. Wavelets Multiresolution Inf. Process. B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan, S. P. Raja
2023	J	`jnl`	Total outer connected vertex-edge domination. Discret. Math. Algorithms Appl. B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
2022	J	`jnl`	Super domination in trees. Discret. Math. Algorithms Appl. B. Senthilkumar, Yanamandram B. Venkatakrishnan, H. Naresh Kumar
2021	J	`jnl`	A lower bound on the total vertex-edge domination number of a tree. Discret. Math. Algorithms Appl. B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
2021	J	`jnl`	Bounds on total edge domination number of a tree. Discret. Math. Algorithms Appl. B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan
2021	J	`jnl`	Double vertex-edge domination in graphs: complexity and algorithms. J. Appl. Math. Comput. H. Naresh Kumar, Dinabandhu Pradhan, Yanamandram B. Venkatakrishnan
2021	J	`jnl`	On trees with domination number equal to edge-vertex roman domination number. Discret. Math. Algorithms Appl. H. Naresh Kumar, Yanamandram B. Venkatakrishnan
2019	B	`conf`	On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs. WALCOM Yanamandram B. Venkatakrishnan, H. Naresh Kumar