Domination versus edge domination on claw-free graphs
Küçük Resim Yok
Tarih
2023
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
When G is a (finite and simple) graph, we prove that its domination number is at most its edge-domination number if G is a claw-free graph with minimum degree at least two. That generalizes an earlier result of Baste et al. (2020) on cubic claw-free graphs.(c) 2023 Elsevier B.V. All rights reserved.
Açıklama
Anahtar Kelimeler
Domination, Edge domination, Minimum maximal matching, Claw-free
Kaynak
Discrete Applied Mathematics
WoS Q Değeri
Q3
Scopus Q Değeri
Q2
Cilt
337
