Domination versus edge domination on claw-free graphs

dc.authoridYetim, Mehmet Akif/0000-0002-3482-5137en_US
dc.authoridDeniz, Zakir/0000-0002-0701-0397en_US
dc.authorscopusid35611132200en_US
dc.authorscopusid56462806000en_US
dc.authorscopusid57208254403en_US
dc.authorwosidYetim, Mehmet Akif/AAV-5238-2021en_US
dc.contributor.authorCivan, Yusuf
dc.contributor.authorDeniz, Zakir
dc.contributor.authorYetim, Mehmet Akif
dc.date.accessioned2024-08-23T16:04:51Z
dc.date.available2024-08-23T16:04:51Z
dc.date.issued2023en_US
dc.departmentDüzce Üniversitesien_US
dc.description.abstractWhen 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.en_US
dc.identifier.doi10.1016/j.dam.2023.05.002
dc.identifier.endpage172en_US
dc.identifier.issn0166-218X
dc.identifier.issn1872-6771
dc.identifier.scopus2-s2.0-85159550825en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage171en_US
dc.identifier.urihttps://doi.org/10.1016/j.dam.2023.05.002
dc.identifier.urihttps://hdl.handle.net/20.500.12684/14388
dc.identifier.volume337en_US
dc.identifier.wosWOS:001005290900001en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofDiscrete Applied Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDominationen_US
dc.subjectEdge dominationen_US
dc.subjectMinimum maximal matchingen_US
dc.subjectClaw-freeen_US
dc.titleDomination versus edge domination on claw-free graphsen_US
dc.typeArticleen_US

Files