Graphs of given order and size and minimum algebraic connectivity
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:02:04Z | |
dc.date.available | 2015-01-15T23:02:04Z | |
dc.date.issued | 2012-04-01 | |
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 | The structure of connected graphs of given size and order that have minimal algebraic connectivity is investigated. It is shown that they must consist of a chain of cliques. Moreover, an upper bound for the number of maximal cliques of size 2 or larger is derived. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Bıyıkoğlu, T. & Leydold, J. (2012). Graphs of given order and size and minimum algebraic connectivity. Linear Algebra and its Applications, 436(7), 2067-2077. doi:10.1016/j.laa.2011.09.026 | en_US |
dc.identifier.doi | 10.1016/j.laa.2011.09.026 | |
dc.identifier.endpage | 2077 | |
dc.identifier.issn | 0024-3795 | |
dc.identifier.issue | 7 | |
dc.identifier.scopus | 2-s2.0-84857111890 | |
dc.identifier.scopusquality | Q1 | |
dc.identifier.startpage | 2067 | |
dc.identifier.uri | https://hdl.handle.net/11729/448 | |
dc.identifier.uri | http://dx.doi.org/10.1016/j.laa.2011.09.026 | |
dc.identifier.volume | 436 | |
dc.identifier.wos | WOS:000301083100018 | |
dc.identifier.wosquality | Q1 | |
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 | Fiedler vector | en_US |
dc.subject | AutoGraphiX | en_US |
dc.subject | Trees | en_US |
dc.subject | Algebra | en_US |
dc.subject | Graph in graph theory | en_US |
dc.subject | Signless laplacian | en_US |
dc.subject | Connected graph | en_US |
dc.subject | Fiedler vectors | en_US |
dc.subject | Maximal clique | en_US |
dc.subject | Upper bound | en_US |
dc.subject | Linear algebra | en_US |
dc.subject | Mathematical techniques | en_US |
dc.title | Graphs of given order and size and minimum algebraic connectivity | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 448.pdf
- Boyut:
- 364.22 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version