Some notes on spectra of cographs
dc.contributor.author | Bıyıkoğlu, Türker | en_US |
dc.contributor.author | Simic, Slobodan K. | en_US |
dc.contributor.author | Stanic, Zoran | en_US |
dc.date.accessioned | 2015-01-15T23:01:52Z | |
dc.date.available | 2015-01-15T23:01:52Z | |
dc.date.issued | 2011-07 | |
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 | A cograph is a P-4-free graph. We first give a short proof of the fact that 0 (-1) belongs to the spectrum of a connected cograph (with at least two vertices) if and only if it contains duplicate (resp. coduplicate) vertices. As a consequence, we next prove that the polynomial reconstruction of graphs whose vertex-deleted subgraphs have the second largest eigenvalue not exceeding root 5-1/2 is unique. | en_US |
dc.description.sponsorship | Research is partially supported by Serbian Ministry of Science, Project 144015D | en_US |
dc.description.sponsorship | Research is partially supported by Serbian Ministry of Science, Project 144032D | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Bıyıkoğlu, T., Simic, S. K. & Stanic, Z. (2011). Some notes on spectra of cographs. Ars Combinatoria, 100, 421-434. | en_US |
dc.identifier.endpage | 434 | |
dc.identifier.issn | 0381-7032 | |
dc.identifier.scopus | 2-s2.0-79959471030 | |
dc.identifier.scopusquality | Q4 | |
dc.identifier.startpage | 421 | |
dc.identifier.uri | https://hdl.handle.net/11729/415 | |
dc.identifier.volume | 100 | |
dc.identifier.wos | WOS:000291893800036 | |
dc.identifier.wosquality | Q4 | |
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 | Charles Babbage Res Ctr | en_US |
dc.relation.ispartof | Ars Combinatoria | 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 | Cograph | en_US |
dc.subject | Characteristic polynomial | en_US |
dc.subject | Eigenvalues | en_US |
dc.subject | Polynomial reconstruction | en_US |
dc.subject | Sigma-graph | en_US |
dc.subject | Graphs | en_US |
dc.subject | Algebraic connectivity | en_US |
dc.subject | Graph in graph theory | en_US |
dc.subject | Signless Laplacian | en_US |
dc.title | Some notes on spectra of cographs | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 415.pdf
- Boyut:
- 228.98 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version