dc.contributor.author | Sorgun, Sezer | |
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 | 1572-5286 | |
dc.identifier.uri | https://dx.doi.org/10.1016/j.disopt.2012.03.001 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12513/2799 | |
dc.description | WOS: 000304736800006 | en_US |
dc.description.abstract | We consider weighted graphs, such as graphs where the edge weights are positive definite matrices. The Laplacian eigenvalues of a graph are the eigenvalues of the Laplacian matrix of a graph G. We obtain an upper bound for the largest Laplacian eigenvalue and we compare this bound with previously known bounds. (C) 2012 Elsevier B.V. All rights reserved. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | ELSEVIER SCIENCE BV | en_US |
dc.relation.isversionof | 10.1016/j.disopt.2012.03.001 | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Weighted graph | en_US |
dc.subject | Laplacian matrix | en_US |
dc.subject | Upper bound | en_US |
dc.title | On the bounds for the largest Laplacian eigenvalues of weighted graphs | en_US |
dc.type | article | en_US |
dc.relation.journal | DISCRETE OPTIMIZATION | en_US |
dc.contributor.department | Kırşehir Ahi Evran Üniversitesi, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
dc.identifier.volume | 9 | en_US |
dc.identifier.issue | 2 | en_US |
dc.identifier.startpage | 122 | en_US |
dc.identifier.endpage | 129 | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |