| dc.contributor.author | Maden, A. Dilek | |
| dc.contributor.author | Buyukkose, Serife | |
| dc.date.accessioned | 2019-11-24T20:57:42Z | |
| dc.date.available | 2019-11-24T20:57:42Z | |
| dc.date.issued | 2012 | |
| dc.identifier.issn | 1331-4343 | |
| dc.identifier.uri | https://dx.doi.org/10.7153/mia-15-46 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12513/2797 | |
| dc.description | WOS: 000306591100004 | en_US |
| dc.description.abstract | Let 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.sponsorship | BAP project of Selcuk UniversitySelcuk University | en_US |
| dc.description.sponsorship | This paper is partially supported by the BAP project of Selcuk University. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | ELEMENT | en_US |
| dc.relation.isversionof | 10.7153/mia-15-46 | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | algebraic connectivity | en_US |
| dc.subject | Laplacian eigenvalues | en_US |
| dc.subject | trace | en_US |
| dc.title | Bounds For Laplacıan Graph Eıgenvalues | en_US |
| dc.type | article | en_US |
| dc.relation.journal | MATHEMATICAL INEQUALITIES & APPLICATIONS | en_US |
| dc.contributor.department | Kırşehir Ahi Evran Üniversitesi, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
| dc.identifier.volume | 15 | en_US |
| dc.identifier.issue | 3 | en_US |
| dc.identifier.startpage | 529 | en_US |
| dc.identifier.endpage | 536 | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
