On graphs admitting two disjoint maximum independent sets
| dc.authorscopusid | 56462806000 | |
| dc.authorscopusid | 7006080024 | |
| dc.authorscopusid | 6505847868 | |
| dc.contributor.author | Deniz, Zakir | |
| dc.contributor.author | Levit, V.E. | |
| dc.contributor.author | Mandrescu, E. | |
| dc.date.accessioned | 2023-07-26T11:57:23Z | |
| dc.date.available | 2023-07-26T11:57:23Z | |
| dc.date.issued | 2023 | |
| dc.department | DÜ, Fen-Edebiyat Fakültesi, Matematik Bölümü | en_US |
| dc.description.abstract | An independent set S is maximal if it is not a proper subset of an independent set, while S is maximum if it has a maximum size. The problem of whether a graph has a pair of disjoint maximal independent sets was introduced by Berge in the early 1970s. The class of graphs for which every induced subgraph admits two disjoint maximal independent sets was characterized by Schaudt in 2015. In this paper, we are focused on finding conditions ensuring the existence of two disjoint maximum independent sets. © 2022 Colegio Oficial de la Psicología de Madrid. | en_US |
| dc.identifier.doi | 10.26493/2590-9770.1563.5f6 | |
| dc.identifier.issn | 2590-9770 | |
| dc.identifier.issue | 1 | en_US |
| dc.identifier.scopus | 2-s2.0-85140998900 | en_US |
| dc.identifier.scopusquality | Q2 | en_US |
| dc.identifier.uri | https://doi.org/10.26493/2590-9770.1563.5f6 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12684/13154 | |
| dc.identifier.volume | 6 | en_US |
| dc.indekslendigikaynak | Scopus | en_US |
| dc.institutionauthor | Deniz, Zaki | |
| dc.language.iso | en | en_US |
| dc.publisher | University of Primorska | en_US |
| dc.relation.ispartof | Art of Discrete and Applied Mathematics | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.snmz | $2023V1Guncelleme$ | en_US |
| dc.subject | almost bipartite graph | en_US |
| dc.subject | König-Egervàry graph | en_US |
| dc.subject | Maximum independent set | en_US |
| dc.subject | shedding vertex | en_US |
| dc.subject | unicyclic graph | en_US |
| dc.title | On graphs admitting two disjoint maximum independent sets | en_US |
| dc.type | Article | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1
Yükleniyor...
- İsim:
- 13154.pdf
- Boyut:
- 372.6 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Tam Metin / Full Text
