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.

Article Details

How to Cite
1.
Hn-Domination in Graphs. Baghdad Sci.J [Internet]. 2019 Mar. 17 [cited 2024 Mar. 28];16(1(Suppl.):0242. Available from: https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/3240
Section
article

How to Cite

1.
Hn-Domination in Graphs. Baghdad Sci.J [Internet]. 2019 Mar. 17 [cited 2024 Mar. 28];16(1(Suppl.):0242. Available from: https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/3240

Similar Articles

You may also start an advanced similarity search for this article.