Some dominating results of the join and corona operations between discrete topological graphs
نویسندگان
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.6795چکیده
The dominating sets play an important role in applications of graph theory. In this field, some recent studies discussed the properties of the minimum dominating set ($\gamma $-set). The other type of study produces a topological space from the set of vertices or the set of edges of a graph. The previous paper introduces a new method to construct a graph $G_{\tau }$ from the topological space. In this paper, the dominating set and the domination number of $G_{\tau }$ are proved with their inverse. The domination number and inverse domination number of corona operation and join operation between two graphs are discussed.
