K. Ganesamoorthy

According to our database, K. Ganesamoorthy authored at least 9 papers between 2014 and 2023.

Collaborative distances:

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

2023

More on the outer connected geodetic number of a graph.

K. Ganesamoorthy, D. Jayanthi

Discret. Math. Algorithms Appl., July, 2023

The restrained double geodetic number of a graph.

A. P. Santhakumaran, K. Ganesamoorthy

Discret. Math. Algorithms Appl., April, 2023

The upper connected outer connected monophonic number of a graph.

K. Ganesamoorthy, S. Lakshmi Priya

Int. J. Comput. Math. Comput. Syst. Theory, January, 2023

2022

The Upper and Forcing Connected Outer Connected Geodetic Numbers of a Graph.

K. Ganesamoorthy, D. Jayanthi

J. Interconnect. Networks, 2022

Minimal total open monophonic sets in graphs.

A. P. Santhakumaran, M. Mahendran, F. Simon Raj, K. Ganesamoorthy

Int. J. Comput. Math. Comput. Syst. Theory, 2022

On the connected monophonic number of a graph.

K. Ganesamoorthy, M. Murugan, A. P. Santhakumaran

Int. J. Comput. Math. Comput. Syst. Theory, 2022

2016

Upper Detour Monophonic Number of a Graph.

P. Titus, K. Ganesamoorthy

Electron. Notes Discret. Math., 2016

On The Detour Monophonic Number of a Graph.

P. Titus, K. Ganesamoorthy

Ars Comb., 2016

2014

The Connected Monophonic Number of a Graph.

P. Titus, K. Ganesamoorthy

Graphs Comb., 2014