default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. P. Santhakumaran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]A. P. Santhakumaran, K. Ganesamoorthy
:
The restrained double geodetic number of a graph. Discret. Math. Algorithms Appl. 15(3): 2250100:1-2250100:13 (2023)- 2022
- [j23]A. P. Santhakumaran, M. Mahendran, F. Simon Raj, K. Ganesamoorthy:
Minimal total open monophonic sets in graphs. Int. J. Comput. Math. Comput. Syst. Theory 7(1): 6-15 (2022) - [j22]K. Ganesamoorthy, M. Murugan, A. P. Santhakumaran:
On the connected monophonic number of a graph. Int. J. Comput. Math. Comput. Syst. Theory 7(2): 139-148 (2022)
2010 – 2019
- 2017
- [j21]S. V. Ullas Chandran, A. P. Santhakumaran:
On the monophonic sets of the strong product graphs. Ars Comb. 132: 219-229 (2017) - 2012
- [j20]A. P. Santhakumaran, P. Titus:
The Geo-Number Of A Graph. Ars Comb. 106: 65-78 (2012) - [j19]A. P. Santhakumaran:
Extreme Steiner Graphs. Discret. Math. Algorithms Appl. 4(2) (2012) - [j18]A. P. Santhakumaran, P. Titus:
A Note on "Monophonic Distance in Graphs". Discret. Math. Algorithms Appl. 4(2) (2012) - [j17]A. P. Santhakumaran:
Median of a graph with respect to edges. Discuss. Math. Graph Theory 32(1): 19-29 (2012) - [j16]T. Jebaraj, A. P. Santhakumaran:
Double geodetic number of a graph. Discuss. Math. Graph Theory 32(1): 109-119 (2012) - [j15]A. P. Santhakumaran, P. Titus:
The vertex monophonic number of a graph. Discuss. Math. Graph Theory 32(2): 191-204 (2012) - [j14]A. P. Santhakumaran, S. V. Ullas Chandran:
The vertex detour hull number of a graph. Discuss. Math. Graph Theory 32(2): 321-330 (2012) - 2011
- [j13]A. P. Santhakumaran, S. Athisayanathan:
Weak Edge Detour Number of a Graph. Ars Comb. 98: 33-61 (2011) - [j12]A. P. Santhakumaran, P. Titus:
Geodesic Graphs. Ars Comb. 99: 75-82 (2011) - [j11]A. P. Santhakumaran, P. Titus:
On the Vertex Geodomination Number of a Graph. Ars Comb. 101: 137-151 (2011) - [j10]A. P. Santhakumaran, P. Titus:
Monophonic Distance in Graphs. Discret. Math. Algorithms Appl. 3(2): 159-170 (2011) - [j9]A. P. Santhakumaran, T. Jebaraj, S. V. Ullas Chandran:
The Linear geodetic Number of a Graph. Discret. Math. Algorithms Appl. 3(3): 357-368 (2011) - [j8]Johnson John, A. P. Santhakumaran:
The forcing Steiner number of a graph. Discuss. Math. Graph Theory 31(1): 171-181 (2011) - [j7]A. P. Santhakumaran, P. Titus:
The connected forcing connected vertex detour number of a graph. Discuss. Math. Graph Theory 31(3): 461-473 (2011) - [j6]A. P. Santhakumaran, S. V. Ullas Chandran:
The hull number of strong product graphs. Discuss. Math. Graph Theory 31(3): 493-507 (2011) - [j5]Johnson John, A. P. Santhakumaran:
On the forcing geodetic and forcing Steiner numbers of a graph. Discuss. Math. Graph Theory 31(4): 611-624 (2011) - 2010
- [j4]A. P. Santhakumaran, S. V. Ullas Chandran:
The edge geodetic number and Cartesian product of graphs. Discuss. Math. Graph Theory 30(1): 55-73 (2010) - [j3]S. Athisayanathan, A. P. Santhakumaran:
On edge detour graphs. Discuss. Math. Graph Theory 30(1): 155-174 (2010) - [j2]A. P. Santhakumaran, S. V. Ullas Chandran:
The geodetic number of strong product graphs. Discuss. Math. Graph Theory 30(4): 687-700 (2010)
2000 – 2009
- 2009
- [j1]A. P. Santhakumaran, P. Titus, Johnson John:
The upper connected geodetic number and forcing connected geodetic number of a graph. Discret. Appl. Math. 157(7): 1571-1580 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
