We stand with Ukraine  

A. P. Santhakumaran

According to our database1, A. P. Santhakumaran authored at least 24 papers between 2009 and 2023.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
The restrained double geodetic number of a graph.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
K. Ganesamoorthy
Discret. Math. Algorithms Appl., April, 2023

2022
Minimal total open monophonic sets in graphs.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
K. Ganesamoorthy
,
M. Murugan
,
A. P. Santhakumaran
Int. J. Comput. Math. Comput. Syst. Theory, 2022

2017
On the monophonic sets of the strong product graphs.
[BibTeX]
S. V. Ullas Chandran
,
A. P. Santhakumaran
Ars Comb., 2017

2012
The vertex monophonic number of a graph.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
P. Titus
Discuss. Math. Graph Theory, 2012

The vertex detour hull number of a graph.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
S. V. Ullas Chandran
Discuss. Math. Graph Theory, 2012

Median of a graph with respect to edges.
[BibTeX]
[DOI]
A. P. Santhakumaran
Discuss. Math. Graph Theory, 2012

Double geodetic number of a graph.
[BibTeX]
[DOI]
T. Jebaraj
,
A. P. Santhakumaran
Discuss. Math. Graph Theory, 2012

A Note on "Monophonic Distance in Graphs".
[BibTeX]
[DOI]
A. P. Santhakumaran
,
P. Titus
Discret. Math. Algorithms Appl., 2012

Extreme Steiner Graphs.
[BibTeX]
[DOI]
A. P. Santhakumaran
Discret. Math. Algorithms Appl., 2012

The Geo-Number Of A Graph.
[BibTeX]
A. P. Santhakumaran
,
P. Titus
Ars Comb., 2012

2011
The connected forcing connected vertex detour number of a graph.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
P. Titus
Discuss. Math. Graph Theory, 2011

The hull number of strong product graphs.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
S. V. Ullas Chandran
Discuss. Math. Graph Theory, 2011

On the forcing geodetic and forcing Steiner numbers of a graph.
[BibTeX]
[DOI]
Johnson John
,
A. P. Santhakumaran
Discuss. Math. Graph Theory, 2011

The forcing Steiner number of a graph.
[BibTeX]
[DOI]
Johnson John
,
A. P. Santhakumaran
Discuss. Math. Graph Theory, 2011

Monophonic Distance in Graphs.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
P. Titus
Discret. Math. Algorithms Appl., 2011

The Linear geodetic Number of a Graph.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
T. Jebaraj
,
S. V. Ullas Chandran
Discret. Math. Algorithms Appl., 2011

On the Vertex Geodomination Number of a Graph.
[BibTeX]
A. P. Santhakumaran
,
P. Titus
Ars Comb., 2011

Geodesic Graphs.
[BibTeX]
A. P. Santhakumaran
,
P. Titus
Ars Comb., 2011

Weak Edge Detour Number of a Graph.
[BibTeX]
A. P. Santhakumaran
,
S. Athisayanathan
Ars Comb., 2011

2010
The geodetic number of strong product graphs.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
S. V. Ullas Chandran
Discuss. Math. Graph Theory, 2010

The edge geodetic number and Cartesian product of graphs.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
S. V. Ullas Chandran
Discuss. Math. Graph Theory, 2010

On edge detour graphs.
[BibTeX]
[DOI]
S. Athisayanathan
,
A. P. Santhakumaran
Discuss. Math. Graph Theory, 2010

2009
The upper connected geodetic number and forcing connected geodetic number of a graph.
[BibTeX]
[DOI]
A. P. Santhakumaran
,
P. Titus
,
Johnson John
Discret. Appl. Math., 2009


  Loading...