Open AccessHn-Domination in Graphs
Author(s) -
Omran Et al.
Publication year - 2019
Publication title -
mağallaẗ baġdād li-l-ʿulūm
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.167
H-Index - 6
eISSN - 2411-7986
pISSN - 2078-8665
DOI - 10.21123/bsj.16.1.(suppl.).0242
Subject(s) - vertex (graph theory) , combinatorics , mathematics , domination analysis , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , artificial intelligence
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . 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.