default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDP. Jeyanthi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j16]K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi
, Maged Z. Youssef:
k-Product cordial labeling of product of graphs. Discret. Math. Algorithms Appl. 16(1): 2250187:1-2250187:8 (2024)- 2023
- [j15]Pamula Udayaraju, P. Jeyanthi, B. V. D. S. Sekhar:
A hybrid multilayered classification model with VGG-19 net for retinal diseases using optical coherence tomography images. Soft Comput. 27(17): 12559-12570 (2023) - 2022
- [j14]Y. Justindhas, P. Jeyanthi:
Attack detection and prevention in IoT-SCADA networks using NK-classifier. Soft Comput. 26(14): 6811-6823 (2022) - 2017
- [j13]P. Jeyanthi, N. T. Muthuraja, Andrea Semanicová-Fenovcíková, S. J. Dharshikha:
More classes of super cycle-antimagic graphs. Australas. J Comb. 67: 46-64 (2017) - 2016
- [j12]P. Jeyanthi, T. Saratha Devi:
Edge pair sum labeling of some cartesian product of graphs. Discret. Math. Algorithms Appl. 8(2): 1650024:1-1650024:10 (2016) - [j11]P. Jeyanthi, K. Jeya Daisy:
Zk-Magic labeling of subdivision graphs. Discret. Math. Algorithms Appl. 8(3): 1650046:1-1650046:19 (2016) - 2015
- [j10]P. Jeyanthi, N. Angel Benseera, Gee-Choon Lau:
On k-totally magic cordial labeling of graphs. Discret. Math. Algorithms Appl. 7(3): 1550024:1-1550024:7 (2015) - [j9]P. Jeyanthi, R. Gomathi:
Odd Mean Labeling of Chain of Graphs. Electron. Notes Discret. Math. 48: 157-160 (2015) - [j8]P. Jeyanthi, A. Maheswari:
Further Results on Vertex Equitable Graphs. Electron. Notes Discret. Math. 48: 161-164 (2015) - [j7]P. Jeyanthi, S. Philo:
Odd Harmonious Labeling of Some New Families of Graphs. Electron. Notes Discret. Math. 48: 165-168 (2015) - [j6]P. Jeyanthi, T. Saratha Devi, Gee-Choon Lau:
Some results on edge pair sum labeling. Electron. Notes Discret. Math. 48: 169-173 (2015) - [j5]P. Jeyanthi, A. Sudha:
Total Edge Irregularity Strength of Disjoint Union of Wheel Graphs. Electron. Notes Discret. Math. 48: 175-182 (2015) - 2013
- [j4]P. Jeyanthi, P. Selvagopal:
Some C4-supermagic graphs. Ars Comb. 111: 129-136 (2013) - [j3]D. Ramya, R. Ponraj, P. Jeyanthi:
Super Mean Labeling Of Graphs. Ars Comb. 112: 65-72 (2013) - 2006
- [j2]V. Swaminathan, P. Jeyanthi:
Super edge-magic strength of fire crackers, banana trees and unicyclic graphs. Discret. Math. 306(14): 1624-1636 (2006) - 2003
- [j1]V. Swaminathan, P. Jeyanthi:
Super Edge - Magic Strength of Fire Crackers, Banana Trees and Unicyclic Graphs. Electron. Notes Discret. Math. 15: 205-206 (2003)
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-05-08 21:44 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:
