Algebraic connectivity and degree sequences of trees
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:19Z | |
dc.date.available | 2015-01-15T23:01:19Z | |
dc.date.issued | 2009-01-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 investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on non-pendant vertices starting at the characteristic set of the Fiedler vector. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Bıyıkoğlu, T., & Leydold, J. (2009). Algebraic connectivity and degree sequences of trees. Linear Algebra and its Applications, 430(2), 811-817. doi:10.1016/j.laa.2008.09.030 | en_US |
dc.identifier.doi | 10.1016/j.laa.2008.09.030 | |
dc.identifier.endpage | 817 | |
dc.identifier.issn | 0024-3795 | |
dc.identifier.issn | 1873-1856 | |
dc.identifier.issue | 2-3 | |
dc.identifier.scopus | 2-s2.0-55549126787 | |
dc.identifier.scopusquality | Q1 | |
dc.identifier.startpage | 811 | |
dc.identifier.uri | https://hdl.handle.net/11729/342 | |
dc.identifier.uri | http://dx.doi.org/10.1016/j.laa.2008.09.030 | |
dc.identifier.volume | 430 | |
dc.identifier.wos | WOS:000261547100021 | |
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 | Elsevier Science Inc | en_US |
dc.relation.ispartof | Linear Algebra and Its Applications | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Algebraic connectivity | en_US |
dc.subject | Graph Laplacian | en_US |
dc.subject | Tree | en_US |
dc.subject | Fiedler vector | en_US |
dc.subject | Dirichlet matrix | en_US |
dc.subject | Degree sequence | en_US |
dc.subject | Graph in graph theory | en_US |
dc.subject | Signless Laplacian | en_US |
dc.subject | Graphs | en_US |
dc.title | Algebraic connectivity and degree sequences of trees | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 342.pdf
- Boyut:
- 134.32 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version