Hn-Domination in Graphs

Main Article Content

Omran et al.

Abstract

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.

Downloads

Download data is not yet available.

Article Details

How to Cite
1.
et al. O. Hn-Domination in Graphs. BSJ [Internet]. 17Mar.2019 [cited 20Jun.2019];16(1):0242. Available from: http://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/3240
Section
article