Disjoint Paired-Dominating sets in Cubic Graphs

被引：1
|
作者：
Bacso, Gabor [1 ]
Bujtas, Csilla [2 ,3 ]
Tompkins, Casey [4 ,5 ]
Tuza, Zsolt [2 ,4 ]
机构：
[1] Hungarian Acad Sci, Comp & Automat Inst, Budapest, Hungary
[2] Univ Pannonia, Fac Informat Technol, Veszprem, Hungary
[3] Univ Ljubljana, Fac Math & Phys, Ljubljana, Slovenia
[4] Hungarian Acad Sci, Alfred Renyi Inst Math, Budapest, Hungary
[5] Karlsruhe Inst Technol, Karlsruhe, Germany
来源：
GRAPHS AND COMBINATORICS | 2019年 / 35卷 / 05期
基金：
欧洲研究理事会;
关键词：
Dominating set; Total dominating set; Paired-dominating set; Claw-free graph; Cubic graph; NUMBER;
D O I：
10.1007/s00373-019-02063-w
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A paired-dominating set of a graph G is a dominating set D with the additional requirement that the induced subgraph G[D] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.
引用
收藏
页码：1129 / 1138
页数：10
相关论文
共 50 条
12345