Domination versus edge domination on claw-free graphs

CİVAN Y., Deniz Z., YETİM M. A.

Discrete Applied Mathematics, cilt.337, ss.171-172, 2023 (SCI-Expanded, Scopus)

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 337
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1016/j.dam.2023.05.002
  • Dergi Adı: Discrete Applied Mathematics
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, Applied Science & Technology Source, Compendex, Computer & Applied Sciences, INSPEC, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.171-172
  • Anahtar Kelimeler: Claw-free, Domination, Edge domination, Minimum maximal matching
  • Süleyman Demirel Üniversitesi Adresli: Evet

Ö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.