Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
