| dc.creator |
YETİM, Mehmet Akif |
|
| dc.creator |
CİVAN, Yusuf |
|
| dc.creator |
Deniz, Zakir |
|
| dc.date |
2023-10-15T00:00:00Z |
|
| dc.date.accessioned |
2025-02-25T10:21:24Z |
|
| dc.date.available |
2025-02-25T10:21:24Z |
|
| dc.identifier |
4a662a24-6d86-40c3-8e64-f9bc96cf0e2e |
|
| dc.identifier |
10.1016/j.dam.2023.05.002 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/4a662a24-6d86-40c3-8e64-f9bc96cf0e2e/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/99596 |
|
| dc.description |
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. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Domination versus edge domination on claw-free graphs |
|
| dc.type |
info:eu-repo/semantics/article |
|