Graphs with given degree sequence and maximal spectral radius
dc.authorid | 0000-0002-9076-4893 | |
dc.contributor.author | Bıyıkoğlu, Türker | en_US |
dc.contributor.author | Leydold, Josef | en_US |
dc.date.accessioned | 2015-01-15T23:01:06Z | |
dc.date.available | 2015-01-15T23:01:06Z | |
dc.date.issued | 2008-09-15 | |
dc.department | Işık Üniversitesi, Fen Edebiyat Fakültesi, Matematik Bölümü | en_US |
dc.department | Işık University, Faculty of Arts and Sciences, Department of Mathematics | en_US |
dc.description.abstract | We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of the vertices induced by breadth-first search. For trees the resulting structure is uniquely determined up to isomorphism. We also show that the largest spectral radius in such classes of trees is strictly monotone with respect to majorization. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Bıyıkoǧlu, T. & Leydold, J. (2008). Graphs with given degree sequence and maximal spectral radius. Electronic Journal of Combinatorics, 15(1), 1-9. | en_US |
dc.identifier.endpage | 9 | |
dc.identifier.issn | 1077-8926 | |
dc.identifier.issue | 1 | |
dc.identifier.scopus | 2-s2.0-52249084347 | |
dc.identifier.scopusquality | Q2 | |
dc.identifier.startpage | 1 | |
dc.identifier.uri | https://hdl.handle.net/11729/288 | |
dc.identifier.volume | 15 | |
dc.identifier.wos | WOS:000259184100006 | |
dc.identifier.wosquality | Q2 | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Science Citation Index Expanded (SCI-EXPANDED) | en_US |
dc.institutionauthor | Bıyıkoğlu, Türker | en_US |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Electronic Journal of Combinatorics | en_US |
dc.relation.ispartof | Electronic Journal of Combinatorics | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Adjacency Matrix | en_US |
dc.subject | Eigenvectors | en_US |
dc.subject | Spectral Radius | en_US |
dc.subject | Degree Sequence | en_US |
dc.subject | Perron Vector | en_US |
dc.subject | Tree | en_US |
dc.subject | Majorization | en_US |
dc.subject | Graph in graph theory | en_US |
dc.subject | Signless Laplacian | en_US |
dc.subject | Algebraic connectivity | en_US |
dc.subject | Largest eigenvalue | en_US |
dc.subject | Inequality | en_US |
dc.subject | Bounds | en_US |
dc.subject | Index | en_US |
dc.title | Graphs with given degree sequence and maximal spectral radius | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Yükleniyor...
- İsim:
- 288.pdf
- Boyut:
- 122.62 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version