| dc.contributor.author | Sorgun, Sezer | |
| dc.contributor.author | Buyukkose, Serife | |
| dc.date.accessioned | 2019-11-24T20:57:43Z | |
| dc.date.available | 2019-11-24T20:57:43Z | |
| dc.date.issued | 2012 | |
| dc.identifier.issn | 0096-3003 | |
| dc.identifier.uri | https://dx.doi.org/10.1016/j.amc.2011.11.006 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12513/2803 | |
| dc.description | WOS: 000298293200050 | en_US |
| dc.description.abstract | Let us consider weighted graphs, where the weights of the edges are positive definite matrices. The eigenvalues of a weighted graph are the eigenvalues of its adjacency matrix and the spectral radius of a weighted graph is also the spectral radius of its adjacency matrix. In this paper, we obtain two upper bounds for the spectral radius of weighted graphs and compare with a known upper bound. We also characterize graphs for which the upper bounds are attained. (C) 2011 Elsevier Inc. All rights reserved. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | ELSEVIER SCIENCE INC | en_US |
| dc.relation.isversionof | 10.1016/j.amc.2011.11.006 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Weighted graph | en_US |
| dc.subject | Adjacency matrix | en_US |
| dc.subject | Spectral radius | en_US |
| dc.subject | Upper bound | en_US |
| dc.title | The new upper bounds on the spectral radius of weighted graphs | en_US |
| dc.type | article | en_US |
| dc.relation.journal | APPLIED MATHEMATICS AND COMPUTATION | en_US |
| dc.contributor.department | Kırşehir Ahi Evran Üniversitesi, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
| dc.identifier.volume | 218 | en_US |
| dc.identifier.issue | 9 | en_US |
| dc.identifier.startpage | 5231 | en_US |
| dc.identifier.endpage | 5238 | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
