BOUNDS FOR LAPLACIAN GRAPH EIGENVALUES

Basit Öğe Kaydı
dc.contributor.authorMaden, A. Dilek
dc.contributor.authorBuyukkose, Serife
dc.date.accessioned2020-03-26T18:24:10Z
dc.date.available2020-03-26T18:24:10Z
dc.date.issued2012
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractLet G be a connected simple graph whose Laplacian eigenvalues are 0 = mu(n) (G) <= mu(n-1) (G) <= ... <= mu(1) (G). In this paper, we establish some upper and lower bounds for the algebraic connectivity and the largest Laplacian eigenvalue of G.en_US
dc.description.sponsorshipBAP project of Selcuk UniversitySelcuk Universityen_US
dc.description.sponsorshipThis paper is partially supported by the BAP project of Selcuk University.en_US
dc.identifier.doi10.7153/mia-15-46en_US
dc.identifier.endpage536en_US
dc.identifier.issn1331-4343en_US
dc.identifier.issue3en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage529en_US
dc.identifier.urihttps://dx.doi.org/10.7153/mia-15-46
dc.identifier.urihttps://hdl.handle.net/20.500.12395/27799
dc.identifier.volume15en_US
dc.identifier.wosWOS:000306591100004en_US
dc.identifier.wosqualityQ2en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELEMENTen_US
dc.relation.ispartofMATHEMATICAL INEQUALITIES & APPLICATIONSen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectalgebraic connectivityen_US
dc.subjectLaplacian eigenvaluesen_US
dc.subjecttraceen_US
dc.titleBOUNDS FOR LAPLACIAN GRAPH EIGENVALUESen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu