Domination versus edge domination on claw-free graphs

被引：2

作者：

Civan, Yusuf ^{[1
]}

Deniz, Zakir ^{[2
]}

Yetim, Mehmet Akif ^{[1
]}

机构：

[1] Suleyman Demirel Univ, Dept Math, TR-32260 Isparta, Turkiye

[2] Duzce Univ, Dept Math, TR-81620 Duzce, Turkiye

来源：

DISCRETE APPLIED MATHEMATICS | 2023年 / 337卷

关键词：

Domination; Edge domination; Minimum maximal matching; Claw-free;

D O I：

10.1016/j.dam.2023.05.002

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.(c) 2023 Elsevier B.V. All rights reserved.

引用

页码：171 / 172

页数：2