Improved Upper and Lower Bounds for the Spectral Radius of Digraphs
dc.contributor.author | Güngör, A. Dilek | |
dc.contributor.author | Das, Kinkar Ch. | |
dc.date.accessioned | 2020-03-26T17:49:07Z | |
dc.date.available | 2020-03-26T17:49:07Z | |
dc.date.issued | 2010 | |
dc.department | Selçuk Üniversitesi | en_US |
dc.description.abstract | Let G be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, sharp upper and lower bounds on rho(G) are given. We show that some known bounds can be obtained from our bounds. | en_US |
dc.description.sponsorship | Office of Selcuk University Scientic ResearchSelcuk University | en_US |
dc.description.sponsorship | A.D.G. and K.Ch.D. thank, respectively, for support by coordinating Office of Selcuk University Scientic Research Projects and Sungkyunkwan University BK21 Project, BK21 Math Modeling HRD Div. Sungkyunkwan University, Suwon, Republic of Korea. | en_US |
dc.identifier.citation | Güngör, A. D., Das, K. C., (2010). Improved Upper and Lower Bounds for the Spectral Radius of Digraphs. Applied Mathematics and Computation, (216), 791-799. Doi: 10.1016/j.amc.2010.01.080 | |
dc.identifier.doi | 10.1016/j.amc.2010.01.080 | en_US |
dc.identifier.endpage | 799 | en_US |
dc.identifier.issn | 0096-3003 | en_US |
dc.identifier.issn | 1873-5649 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.scopusquality | Q1 | en_US |
dc.identifier.startpage | 791 | en_US |
dc.identifier.uri | https://dx.doi.org/10.1016/j.amc.2010.01.080 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/24992 | |
dc.identifier.volume | 216 | en_US |
dc.identifier.wos | WOS:000275739200009 | en_US |
dc.identifier.wosquality | Q1 | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.institutionauthor | Güngör, A. Dilek | |
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/openAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Digraph | en_US |
dc.subject | Spectral radius | en_US |
dc.subject | Bound | en_US |
dc.title | Improved Upper and Lower Bounds for the Spectral Radius of Digraphs | en_US |
dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Yükleniyor...
- İsim:
- 4992.pdf
- Boyut:
- 239.24 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Makale Dosyası