On graphs admitting two disjoint maximum independent sets
Yükleniyor...
Dosyalar
Tarih
2023
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
University of Primorska
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
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.
Açıklama
Anahtar Kelimeler
almost bipartite graph, König-Egervàry graph, Maximum independent set, shedding vertex, unicyclic graph
Kaynak
Art of Discrete and Applied Mathematics
WoS Q Değeri
Scopus Q Değeri
Q2
Cilt
6
Sayı
1
