![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Ayse Dilek Maden
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j12]Salman Mukhtar, Muhammad Salman, Ayse Dilek Maden, Masood Ur Rehman
:
Metric Properties of Non-Commuting Graph Associated to Two Groups. Int. J. Found. Comput. Sci. 33(6&7): 931-952 (2022) - [j11]Havva Kirgiz, Ayse Dilek Maden:
New Bounds for Some Topological Indices. Int. J. Found. Comput. Sci. 33(6&7): 953-965 (2022) - 2020
- [j10]Emrullah Kirklar, Ayse Dilek Maden, Fatih Yilmaz:
Some results on one type of graph family with some special number sequences. AKCE Int. J. Graphs Comb. 17(3): 749-754 (2020)
2010 – 2019
- 2015
- [j9]Kinkar Chandra Das, Ayse Dilek Güngör, S. Burcu Bozkurt:
On the normalized Laplacian eigenvalues of graphs. Ars Comb. 118: 143-154 (2015) - 2013
- [j8]Ayse Dilek Maden, Kinkar Chandra Das, A. Sinan Çevik:
Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph. Appl. Math. Comput. 219(10): 5025-5032 (2013) - [j7]Ahmet Sinan Çevik, Ayse Dilek Maden:
New distance-based graph invariants and relations among them. Appl. Math. Comput. 219(24): 11171-11177 (2013) - [j6]Ayse Dilek Güngör:
On the lower and upper bounds for the Euclidean norm of a complex matrix and its Applications. Ars Comb. 110: 249-264 (2013) - 2011
- [j5]Ayse Dilek Maden, A. Sinan Çevik:
Some bounds for extreme singular values of a complex matrix. Appl. Math. Comput. 218(3): 762-765 (2011) - [j4]Eylem Güzel Karpuz, Firat Ates, A. Sinan Çevik, Ismail Naci Cangül
, Ayse Dilek Maden:
The next step of the word problem over monoids. Appl. Math. Comput. 218(3): 794-798 (2011) - 2010
- [j3]Ayse Dilek Güngör, Kinkar Chandra Das:
Improved upper and lower bounds for the spectral radius of digraphs. Appl. Math. Comput. 216(3): 791-799 (2010) - [j2]Ayse Dilek Güngör:
Erratum to "An upper bound for the condition number of a matrix in spectral norm" [J. Computational Applied Mathematics 143 (2002) 141-144]. J. Comput. Appl. Math. 234(1): 316 (2010)
2000 – 2009
- 2004
- [j1]Ayse Dilek Güngör:
Lower bounds for the norms of Cauchy-Toeplitz and Cauchy-Hankel matrices. Appl. Math. Comput. 157(3): 599-604 (2004)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint