Hn-Domination in Graphs

被引:31
作者
Omran, Ahmed A. [1 ]
Oda, Haneen Hamed [1 ]
机构
[1] Univ Babylon, Coll Educ Pure Sci, Dept Math, Babylon, Iraq
关键词
Hn-domination number; Hn-dominating set; Graph;
D O I
10.21123/bsj.2019.16.1(Suppl.).0242
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by gamma(hn) (G). This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
引用
收藏
页码:242 / 247
页数:6
相关论文
共 10 条
[1]  
AL-Harere M. N., 2017, INT J PURE APPL MATH
[2]   On the Structure of Dominating Graphs [J].
Alikhani, Saeid ;
Fatehi, Davood ;
Klavzar, Sandi .
GRAPHS AND COMBINATORICS, 2017, 33 (04) :665-672
[3]  
Berge C., 1962, THEORY GRAPHS ITS
[4]  
Cockayne E. J., 1977, Networks, V7, P247, DOI 10.1002/net.3230070305
[5]  
Harary F., 1969, GRAPH THEORY
[6]  
Haynes T. W., 1998, FUNDAMENTALS DOMINAT, V1st, DOI [10.1201/9781482246582, DOI 10.1201/9781482246582]
[7]  
Omran A. A., 2017, J ENG APPL SCI, V12, P8882
[8]  
Omran AA, 2017, INT J PURE APP UNPUB
[9]  
Rad NJ, 2017, AKCE INT J GRAPHS CO, V14, P112, DOI 10.1016/j.akcej.2017.01.003
[10]  
Sridharan N, 2017, GRAPHS COMBIN, V18, P667