default search action
Ismail Naci Cangül
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Mohammad Mazyad Hazzazi, Muhammad Nadeem, Muhammad Kamran, Ismail Naci Cangül, J. Akhter:
Holomorphism and Edge Labeling: An Inner Study of Latin Squares Associated with Antiautomorphic Inverse Property Moufang Quasigroups with Applications. Complex. 2024 (2024) - [j17]Aysun Yurttas Gunes
, Hacer Ozden Ayna
The Effect of Vertex and Edge Removal on Sombor Index. Symmetry 16(2): 170 (2024) - [j16]Muhammad Kamran, Manal Elzain Mohamed Abdalla, Muhammad Nadeem, Anns Uzair, Muhammad Farman, Lakhdar Ragoub, Ismail Naci Cangül
A Systematic Formulation into Neutrosophic Z Methodologies for Symmetrical and Asymmetrical Transportation Problem Challenges. Symmetry 16(5): 615 (2024) - 2022
- [j15]Mert Sinan Oz
Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains. J. Appl. Math. Comput. 68(5): 3263-3293 (2022) - 2021
- [j14]Musa Demirci
Lucas graphs. J. Appl. Math. Comput. 65(1-2): 93-106 (2021) - [j13]Kinkar Chandra Das, Ahmet Sinan Çevik
On Sombor Index. Symmetry 13(1): 140 (2021) - 2020
- [j12]R. Kuppan, L. Shobana
Encrypting and decrypting algorithms using strong face graph of a tree. Int. J. Comput. Math. Comput. Syst. Theory 5(4): 225-233 (2020) - [j11]Aysun Yurttas Gunes
Fibonacci Graphs. Symmetry 12(9): 1383 (2020)
2010 – 2019
- 2018
- [j10]Anwar Alwardi
Entire Zagreb indices of graphs. Discret. Math. Algorithms Appl. 10(3): 1850037:1-1850037:16 (2018) - 2013
- [j9]Hacer Ozden, Ismail Naci Cangül
Generalized q-Stirling Numbers and Their Interpolation Functions. Axioms 2(1): 10-19 (2013) - 2012
- [j8]Abdelmejid Bayad
The minimal polynomial of 2 cos(π/q) and Dickson polynomials. Appl. Math. Comput. 218(13): 7014-7022 (2012) - [j7]H. M. Srivastava
A unified presentation of certain meromorphic functions related to the families of the partial zeta type functions and the L-functions. Appl. Math. Comput. 219(8): 3903-3913 (2012) - 2011
- [j6]Ismail Naci Cangül
Preface. Appl. Math. Comput. 218(3): 653-654 (2011) - [j5]Ismail Naci Cangül
Professor H.M. Srivastava: Man and Mathematician. Appl. Math. Comput. 218(3): 655-657 (2011) - [j4]P. S. Ranjini, V. Lokesha
On the Zagreb indices of the line graphs of the subdivision graphs. Appl. Math. Comput. 218(3): 699-702 (2011) - [j3]Arzu Özkoç, Ahmet Tekcan, Ismail Naci Cangül
Solving some parametric quadratic Diophantine equation over Z and Fp. Appl. Math. Comput. 218(3): 703-706 (2011) - [j2]Mehmet Açikgöz
A note on the modified q-Bernstein polynomials for functions of several variables and their reflections on q-Volkenborn integration. Appl. Math. Comput. 218(3): 707-712 (2011) - [j1]Eylem Güzel Karpuz, Firat Ates, A. Sinan Çevik, Ismail Naci Cangül
The next step of the word problem over monoids. Appl. Math. Comput. 218(3): 794-798 (2011)
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-12-26 00:45 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: