Bipartite graphs with close domination and k -domination numbers
Makaleler > Tam Makale · 2020
Yazarlar: Gülnaz BORUZANLI EKİNCİ, Csilla Bujtas
Open Mathematics, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Wos, 2020, cilt 18, ss 873-885
Özet
Abstract Let k k be a positive integer and let G G be a graph with vertex set V ( G ) V(G) . A subset D ⊆ V ( G ) D\subseteq V(G) is a k k -dominating set if every vertex outside D D is adjacent to at least k k vertices in D D . The k k -domination number γ k ( G ) {\gamma }_{k}(G) is the minimum cardinality of a k k -dominating set in G G . For any graph G G , we know that γ k ( G ) ≥ γ ( G ) + k − 2 {\gamma }_{k}(G)\ge \gamma (G)+k-2 where Δ