Variant Domination Types for a Complete h-ary Tree

Authors

Manal N. Al-Harere, Department of Applied Sciences, Branch of Mathematics and Computer Applications, University of Technology, Baghdad, Iraq.Follow
Rasha Jalal Mitlif, Department of Applied Sciences, Branch of Mathematics and Computer Applications, University of Technology, Baghdad, Iraq.Follow
Fatema Ahmad Sadiq, Department of Applied Sciences, Branch of Mathematicsand Computer Applications, University of Technology, Baghdad, IraqFollow
Fatema Ahmad Sadiq, Department of Applied Sciences, Branch of Mathematics and Computer Applications, University of Technology, Baghdad, Iraq.Follow

Abstract

Graph is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Because of the importance of domination in different areas, variant types of domination have been introduced according to the purpose they are used for. In this paper, two domination parameters the first is the restrained and the second is secure domination have been chosn. The secure domination, and some types of restrained domination in one type of trees is called complete ary tree are determined.

Keywords

Complete ℎ-ary trees, Domination, Restrained domination, Secure dominationMathematical subject classification: 05C69

Article Type

Supplemental Issue

How to Cite this Article

Al-Harere, Manal N.; Mitlif, Rasha Jalal; Ahmad Sadiq, Fatema; and Sadiq, Fatema Ahmad (2021) "Variant Domination Types for a Complete h-ary Tree," Baghdad Science Journal: Vol. 18: Iss. 1, Article 31.
DOI: https://doi.org/10.21123/bsj.2021.18.1(Suppl.).0797