Different types of dominating sets of the discrete topological graph
نویسندگان
1 Department of Mathematics, College of Education for Pure Sciences, University of Thi-Qar, Thi-Qar, Iraq
2 Department of Mathematics, College of Education for Pure Sciences, University of Thi-Qar, Thi-Qar, Iraq
doi
10.22075/ijnaa.2022.6452چکیده
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.
