default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanamandram B. Venkatakrishnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]B. Senthilkumar
, H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
Total outer connected vertex-edge domination. Discret. Math. Algorithms Appl. 15(1): 2250057:1-2250057:12 (2023)- [j16]B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan, S. P. Raja:
On the computation of extremal trees of Harmonic index with given edge-vertex domination number. Int. J. Wavelets Multiresolution Inf. Process. 21(5): 2350014:1-2350014:12 (2023) - [j15]B. Senthilkumar, Mustapha Chellali, H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
Graphs with unique minimum vertex-edge dominating sets. RAIRO Oper. Res. 57(4): 1785-1795 (2023) - 2022
- [j14]B. Senthilkumar, Yanamandram B. Venkatakrishnan, H. Naresh Kumar:
Super domination in trees. Discret. Math. Algorithms Appl. 14(4): 2150137:1-2150137:6 (2022) - 2021
- [j13]B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
A lower bound on the total vertex-edge domination number of a tree. Discret. Math. Algorithms Appl. 13(1): 2050091:1-2050091:6 (2021) - [j12]B. Senthilkumar, H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
Bounds on total edge domination number of a tree. Discret. Math. Algorithms Appl. 13(2): 2150011:1-2150011:7 (2021) - [j11]H. Naresh Kumar, Yanamandram B. Venkatakrishnan:
On trees with domination number equal to edge-vertex roman domination number. Discret. Math. Algorithms Appl. 13(4): 2150045:1-2150045:11 (2021) - [j10]H. Naresh Kumar, D. Pradhan, Yanamandram B. Venkatakrishnan:
Double vertex-edge domination in graphs: complexity and algorithms. J. Appl. Math. Comput. 66(1-2): 245-262 (2021)
2010 – 2019
- 2019
- [c1]Yanamandram B. Venkatakrishnan, H. Naresh Kumar:
On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs. WALCOM 2019: 188-198 - 2018
- [j9]B. Krishnakumari, Yanamandram B. Venkatakrishnan, S. K. Ayyaswamy:
Cactus graphs with equal domination and complementary tree domination numbers. Ars Comb. 139: 229-235 (2018) - [j8]Hanyuan Deng, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran:
Extremal Properties of Some Topological Indices of Graphs. Ars Comb. 139: 327-336 (2018) - [j7]Yanamandram B. Venkatakrishnan, Balakrishna Krishnakumari:
An improved upper bound of edge-vertex domination number of a tree. Inf. Process. Lett. 134: 14-17 (2018) - 2017
- [j6]Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan:
On Harmonic Indices of Trees, Unicyclic graphs and Bicyclic graphs. Ars Comb. 130: 239-248 (2017) - [j5]Balakrishna Krishnakumari, Mustapha Chellali, Yanamandram B. Venkatakrishnan:
Double vertex-edge domination. Discret. Math. Algorithms Appl. 9(4): 1750045:1-1750045:11 (2017) - 2016
- [j4]Jianxi Li, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan:
The Randic Indices of Trees, Unicyclic Graphs and Bicyclic Graphs. Ars Comb. 127: 409-419 (2016) - [j3]B. Krishnakumari, Yanamandram B. Venkatakrishnan:
Double domination and super domination in trees. Discret. Math. Algorithms Appl. 8(4): 1650067:1-1650067:6 (2016) - 2015
- [j2]Hanyuan Deng, B. Krishnakumari, Yanamandram B. Venkatakrishnan, Selvaraj Balachandran:
Multiplicatively weighted Harary index of graphs. J. Comb. Optim. 30(4): 1125-1137 (2015) - 2013
- [j1]Hanyuan Deng, Selvaraj Balachandran, S. K. Ayyaswamy, Yanamandram B. Venkatakrishnan:
On the harmonic index and the chromatic number of a graph. Discret. Appl. Math. 161(16-17): 2740-2744 (2013)
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-08-05 21:17 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:
