Hn-Domination in Graphs

Authors

Ahmed A. Omran, Department of Mathematics, College of Education for Pure Science, University of Babylon,Babylon, Iraq.Follow
Haneen Hamed Oda, Department of Mathematics, College of Education for Pure Science, University of Babylon,Babylon, Iraq

Abstract

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

Keywords

Hn-domination number, Hn-dominating set, Graph. Mathematical subject classification: 05C69

Article Type

Supplemental Issue

How to Cite this Article

A. Omran, Ahmed and Hamed Oda, Haneen (2019) "Hn-Domination in Graphs," Baghdad Science Journal: Vol. 16: Iss. 1, Article 32.
DOI: https://doi.org/10.21123/bsj.2019.16.1(Suppl.).0242