共 50 条
Outer-independent k-rainbow domination
被引:9
|作者:
Kang, Qiong
[1
]
Samodivkin, Vladimir
[2
]
Shao, Zehui
[3
]
Sheikholeslami, Seyed Mahmoud
[4
]
Soroudi, Marzieh
[4
]
机构:
[1] Yangtze Univ, Sch Comp Sci, Jingzhou, Peoples R China
[2] Univ Architecture, Dept Math Civil Engn & Geodesy, Sofia, Bulgaria
[3] Guangzhou Univ, Inst Comp Sci & Technol, Guangzhou 510006, Guangdong, Peoples R China
[4] Azarbaijan Shahid Madani Univ, Dept Math, Tabriz, Iran
来源:
JOURNAL OF TAIBAH UNIVERSITY FOR SCIENCE
|
2019年
/
13卷
/
01期
关键词:
k-rainbow dominating function;
k-rainbow domination;
outer-independent domination;
2-RAINBOW DOMINATION;
2-OUTER-INDEPENDENT DOMINATION;
DOMATIC NUMBER;
BOUNDS;
ROMAN;
D O I:
10.1080/16583655.2019.1655255
中图分类号:
O [数理科学和化学];
P [天文学、地球科学];
Q [生物科学];
N [自然科学总论];
学科分类号:
07 ;
0710 ;
09 ;
摘要:
An outer-independent k-rainbow dominating function of a graph G is a function f from to the set of all subsets of such that both the following hold: (i) whenever v is a vertex with , and (ii) the set of all with is independent. The outer-independent k-rainbow domination number of G is the invariant , which is the minimum sum (over all the vertices of G) of the cardinalities of the subsets assigned by an outer-independent k-rainbow dominating function. In this paper, we initiate the study of outer-independent k-rainbow domination. We first investigate the basic properties of the outer-independent k-rainbow domination and then we focus on the outer-independent 2-rainbow domination number and present sharp lower and upper bounds for it.
引用
收藏
页码:883 / 891
页数:9
相关论文