BibTeX records: Ayse Dilek Maden

download as .bib file

@article{DBLP:journals/ijfcs/MukhtarSMR22,
  author       = {Salman Mukhtar and
                  Muhammad Salman and
                  Ayse Dilek Maden and
                  Masood Ur Rehman},
  title        = {Metric Properties of Non-Commuting Graph Associated to Two Groups},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {33},
  number       = {6{\&}7},
  pages        = {931--952},
  year         = {2022},
  url          = {https://doi.org/10.1142/S0129054122420229},
  doi          = {10.1142/S0129054122420229},
  timestamp    = {Sun, 15 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ijfcs/MukhtarSMR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijfcs/KirgizM22,
  author       = {Havva Kirgiz and
                  Ayse Dilek Maden},
  title        = {New Bounds for Some Topological Indices},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {33},
  number       = {6{\&}7},
  pages        = {953--965},
  year         = {2022},
  url          = {https://doi.org/10.1142/S0129054122420230},
  doi          = {10.1142/S0129054122420230},
  timestamp    = {Wed, 11 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijfcs/KirgizM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/akcej/KirklarMY20,
  author       = {Emrullah Kirklar and
                  Ayse Dilek Maden and
                  Fatih Yilmaz},
  title        = {Some results on one type of graph family with some special number
                  sequences},
  journal      = {{AKCE} Int. J. Graphs Comb.},
  volume       = {17},
  number       = {3},
  pages        = {749--754},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.akcej.2019.09.005},
  doi          = {10.1016/J.AKCEJ.2019.09.005},
  timestamp    = {Wed, 11 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/akcej/KirklarMY20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/DasGB15,
  author       = {Kinkar Chandra Das and
                  Ayse Dilek G{\"{u}}ng{\"{o}}r and
                  S. Burcu Bozkurt},
  title        = {On the normalized Laplacian eigenvalues of graphs},
  journal      = {Ars Comb.},
  volume       = {118},
  pages        = {143--154},
  year         = {2015},
  timestamp    = {Thu, 06 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/arscom/DasGB15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amc/MadenDC13,
  author       = {Ayse Dilek Maden and
                  Kinkar Chandra Das and
                  A. Sinan {\c{C}}evik},
  title        = {Sharp upper bounds on the spectral radius of the signless Laplacian
                  matrix of a graph},
  journal      = {Appl. Math. Comput.},
  volume       = {219},
  number       = {10},
  pages        = {5025--5032},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.amc.2012.11.039},
  doi          = {10.1016/J.AMC.2012.11.039},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amc/MadenDC13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amc/CevikM13,
  author       = {Ahmet Sinan {\c{C}}evik and
                  Ayse Dilek Maden},
  title        = {New distance-based graph invariants and relations among them},
  journal      = {Appl. Math. Comput.},
  volume       = {219},
  number       = {24},
  pages        = {11171--11177},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.amc.2013.05.024},
  doi          = {10.1016/J.AMC.2013.05.024},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amc/CevikM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/Gungor13,
  author       = {Ayse Dilek G{\"{u}}ng{\"{o}}r},
  title        = {On the lower and upper bounds for the Euclidean norm of a complex
                  matrix and its Applications},
  journal      = {Ars Comb.},
  volume       = {110},
  pages        = {249--264},
  year         = {2013},
  timestamp    = {Mon, 03 Jun 2013 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/arscom/Gungor13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amc/GungorC11,
  author       = {Ayse Dilek Maden and
                  A. Sinan {\c{C}}evik},
  title        = {Some bounds for extreme singular values of a complex matrix},
  journal      = {Appl. Math. Comput.},
  volume       = {218},
  number       = {3},
  pages        = {762--765},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.amc.2011.03.073},
  doi          = {10.1016/J.AMC.2011.03.073},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amc/GungorC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amc/KarpuzACC11,
  author       = {Eylem G{\"{u}}zel Karpuz and
                  Firat Ates and
                  A. Sinan {\c{C}}evik and
                  Ismail Naci Cang{\"{u}}l and
                  Ayse Dilek Maden},
  title        = {The next step of the word problem over monoids},
  journal      = {Appl. Math. Comput.},
  volume       = {218},
  number       = {3},
  pages        = {794--798},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.amc.2011.03.076},
  doi          = {10.1016/J.AMC.2011.03.076},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amc/KarpuzACC11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amc/GungorD10,
  author       = {Ayse Dilek G{\"{u}}ng{\"{o}}r and
                  Kinkar Chandra Das},
  title        = {Improved upper and lower bounds for the spectral radius of digraphs},
  journal      = {Appl. Math. Comput.},
  volume       = {216},
  number       = {3},
  pages        = {791--799},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.amc.2010.01.080},
  doi          = {10.1016/J.AMC.2010.01.080},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amc/GungorD10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcam/Gungor10,
  author       = {Ayse Dilek G{\"{u}}ng{\"{o}}r},
  title        = {Erratum to "An upper bound for the condition number of a matrix
                  in spectral norm" {[J.} Computational Applied Mathematics 143
                  {(2002)} 141-144]},
  journal      = {J. Comput. Appl. Math.},
  volume       = {234},
  number       = {1},
  pages        = {316},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.cam.2010.01.008},
  doi          = {10.1016/J.CAM.2010.01.008},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcam/Gungor10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/amc/Gungor04,
  author       = {Ayse Dilek G{\"{u}}ng{\"{o}}r},
  title        = {Lower bounds for the norms of Cauchy-Toeplitz and Cauchy-Hankel matrices},
  journal      = {Appl. Math. Comput.},
  volume       = {157},
  number       = {3},
  pages        = {599--604},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.amc.2003.08.103},
  doi          = {10.1016/J.AMC.2003.08.103},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/amc/Gungor04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.