Yanamandram B. Venkatakrishnan

According to our database, Yanamandram B. Venkatakrishnan authored at least 18 papers between 2013 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

2018

An improved upper bound of edge-vertex domination number of a tree.

Yanamandram B. Venkatakrishnan, Balakrishna Krishnakumari

Inf. Process. Lett., 2018

Cactus graphs with equal domination and complementary tree domination numbers.

B. Krishnakumari, Yanamandram B. Venkatakrishnan, S. K. Ayyaswamy

Ars Comb., 2018

Extremal Properties of Some Topological Indices of Graphs.

Hanyuan Deng, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran

Ars Comb., 2018

2017

Double vertex-edge domination.

Balakrishna Krishnakumari, Mustapha Chellali, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., 2017

On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs.

Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan

Ars Comb., 2017

2016

Double domination and super domination in trees.

B. Krishnakumari, Yanamandram B. Venkatakrishnan

Discret. Math. Algorithms Appl., 2016

The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs.

Jianxi Li, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan

Ars Comb., 2016

2015

Multiplicatively weighted Harary index of graphs.

Hanyuan Deng, B. Krishnakumari, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran

J. Comb. Optim., 2015

2013

On the harmonic index and the chromatic number of a graph.

Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan

Discret. Appl. Math., 2013