Civan, YusufDeniz, ZakirYetim, Mehmet Akif2024-08-232024-08-2320230166-218X1872-6771https://doi.org/10.1016/j.dam.2023.05.002https://hdl.handle.net/20.500.12684/14388When 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.en10.1016/j.dam.2023.05.002info:eu-repo/semantics/closedAccessDominationEdge dominationMinimum maximal matchingClaw-freeArticle3371711722-s2.0-85159550825WOS:001005290900001Q2Q3