Document Type : Research Paper

Authors

• Mays K. Idan
• Mohammed A. Abdlhusein

Department of Mathematics, College of Education for Pure Sciences, University of Thi-Qar, Thi-Qar, Iraq

Abstract

The dominating problem is one of the topics in graph theory because of its applications in different areas. In this paper, some dominating sets are applied in the discrete topological graph. Such as independent domination, connected domination, doubly connected domination, total domination, restrained domination, strongly domination and co-neighborhood domination with their inverses.

Keywords

• Independent domination
• doubly connected domination
• total domination
• restrained domination