default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Lavanya 0001
Person information
- affiliation: Indian Institute of Technology Varanasi, India
- affiliation (former): Indian Institute of Technology Madras, Department of Mathematics, India
Other persons with the same name
- S. Lavanya — disambiguation page
- S. Lavanya 0002
![[0000-0002-3465-418X]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-3465-418X")
— Sri Krishna College of Engineering and Technology, Coimbatore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Smrati Pandey, Lavanya Selvaganesh, Jesmina Pervin:
Eccentricity matrix of corona of two graphs. Discret. Appl. Math. 359: 354-363 (2024)- 2023
- [j11]Jesmina Pervin, Lavanya Selvaganesh:
Connected Q-integral graphs with maximum edge-degree less than or equal to 8. Discret. Math. 346(3): 113265 (2023) - [j10]Ajay Kumar, Lavanya Selvaganesh, T. Tamizh Chelvam:
Connectivity of superpower graphs of some non-abelian finite groups. Discret. Math. Algorithms Appl. 15(4): 2250108:1-2250108:19 (2023) - 2022
- [j9]G. Arunkumar, Peter J. Cameron, Rajat Kanti Nath, Lavanya Selvaganesh:
Super Graphs on Groups, I. Graphs Comb. 38(3): 100 (2022) - 2021
- [j8]Ajay Kumar, Lavanya Selvaganesh, Peter J. Cameron, T. Tamizh Chelvam:
Recent developments on the power graph of finite groups - a survey. AKCE Int. J. Graphs Comb. 18(2): 65-94 (2021) - [j7]Ajay Kumar Patel, Lavanya Selvaganesh, Sanjay Kumar Pandey:
Energy and inertia of the eccentricity matrix of coalescence of graphs. Discret. Math. 344(12): 112591 (2021) - [j6]Sivakumar Karunakaran, Lavanya Selvaganesh:
A unique and novel graph matrix for efficient extraction of structural information of networks. Electron. J. Graph Theory Appl. 9(1): 39-51 (2021)
2010 – 2019
- 2019
- [i1]Sivakumar Karunakaran, Lavanya Selvaganesh:
An Unique and Novel Graph Matrix for Efficient Extraction of Structural Information of Networks. CoRR abs/1903.05341 (2019) - 2011
- [j5]Sheshayya A. Choudum, S. Lavanya:
Embedding a subclass of trees into hypercubes. Discret. Math. 311(10-11): 866-871 (2011) - [j4]Sheshayya A. Choudum, S. Lavanya, V. Sunitha:
Embedding double starlike trees into hypercubes. Int. J. Comput. Math. 88(1): 1-5 (2011) - 2010
- [j3]Sheshayya A. Choudum, S. Lavanya, V. Sunitha:
Disjoint paths in hypercubes with prescribed origins and lengths. Int. J. Comput. Math. 87(8): 1692-1708 (2010)
2000 – 2009
- 2009
- [j2]Sheshayya A. Choudum, S. Lavanya:
Complete k-ary trees and Hamming graphs. Australas. J Comb. 45: 15-24 (2009) - 2008
- [j1]Sheshayya A. Choudum, S. Lavanya:
Embedding complete ternary trees into hypercubes. Discuss. Math. Graph Theory 28(3): 463-476 (2008)
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 2025-01-09 13:28 CET 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:
