Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph
dc.contributor.author | Maden, A. Dilek (Gungor) | |
dc.contributor.author | Das, Kinkar Ch. | |
dc.contributor.author | Cevik, A. Sinan | |
dc.date.accessioned | 2020-03-26T18:43:20Z | |
dc.date.available | 2020-03-26T18:43:20Z | |
dc.date.issued | 2013 | |
dc.department | Selçuk Üniversitesi | en_US |
dc.description.abstract | Let G = (V, E) be a simple connected graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G) = D(G) + A(G). In this paper, we obtain some new and improved sharp upper bounds on the spectral radius q(1)(G) of the signless Laplacian matrix of a graph G. (C) 2012 Elsevier Inc. All rights reserved. | en_US |
dc.description.sponsorship | TUBITAKTurkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK); Scientific Research Office of Selcuk University (BAP)Selcuk University; Faculty research Fund, Sungkyunkwan University; Sungkyunkwan University BK21 Project, BK21 Math Modeling HRD Div. Sungkyunkwan University, Suwon, Republic of Korea | en_US |
dc.description.sponsorship | The first and third authors are partially supported by TUBITAK and the Scientific Research Office of Selcuk University (BAP). The second author is partially supported by the Faculty research Fund, Sungkyunkwan University, 2012 and Sungkyunkwan University BK21 Project, BK21 Math Modeling HRD Div. Sungkyunkwan University, Suwon, Republic of Korea. | en_US |
dc.identifier.doi | 10.1016/j.amc.2012.11.039 | en_US |
dc.identifier.endpage | 5032 | en_US |
dc.identifier.issn | 0096-3003 | en_US |
dc.identifier.issue | 10 | en_US |
dc.identifier.scopusquality | Q1 | en_US |
dc.identifier.startpage | 5025 | en_US |
dc.identifier.uri | https://dx.doi.org/10.1016/j.amc.2012.11.039 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/29812 | |
dc.identifier.volume | 219 | en_US |
dc.identifier.wos | WOS:000313825900011 | en_US |
dc.identifier.wosquality | Q1 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | ELSEVIER SCIENCE INC | en_US |
dc.relation.ispartof | APPLIED MATHEMATICS AND COMPUTATION | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Graph | en_US |
dc.subject | Spectral radius | en_US |
dc.subject | Signless Laplacian | en_US |
dc.subject | Bounds | en_US |
dc.subject | Degrees | en_US |
dc.subject | Average degree of neighbors | en_US |
dc.title | Sharp upper bounds on the spectral radius of the signless Laplacian matrix of a graph | en_US |
dc.type | Article | en_US |