Different types of dominating sets of the discrete topological graph

Document Type : Research Paper


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


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.


Volume 14, Issue 1
January 2023
Pages 101-108
  • Receive Date: 17 January 2022
  • Revise Date: 21 February 2022
  • Accept Date: 29 March 2022