Hn-Domination in Graphs


The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by γ_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.