| dc.contributor.author | Büyükköse Ş. | |
| dc.contributor.author | Sorgun S. | |
| dc.date.accessioned | 2019-11-24T20:57:51Z | |
| dc.date.available | 2019-11-24T20:57:51Z | |
| dc.date.issued | 2009 | |
| dc.identifier.issn | 1303-9709 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12513/2881 | |
| dc.description.abstract | Let G be simple, connected weighted graphs, where the edge weights are positive definite matrices. In this paper, we will give an upper bound on the spectral radius of the adjacency matrix for a graph G and characterize graphs for which the bound is attained. | en_US |
| dc.language.iso | eng | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Adjacency matrix | en_US |
| dc.subject | Spectral radius | en_US |
| dc.subject | Upper bound | en_US |
| dc.subject | Weighted graph | en_US |
| dc.title | A bound on the spectral radius of a weighted graph | en_US |
| dc.type | article | en_US |
| dc.relation.journal | Gazi University Journal of Science | en_US |
| dc.contributor.department | Kırşehir Ahi Evran Üniversitesi, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
| dc.identifier.volume | 22 | en_US |
| dc.identifier.issue | 4 | en_US |
| dc.identifier.startpage | 263 | en_US |
| dc.identifier.endpage | 266 | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
