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.
Idan,M K. and Abdlhusein,M A.. (2023). Different types of dominating sets of the discrete topological graph. International Journal of Nonlinear Analysis and Applications, 14(1), 101-108. doi: 10.22075/ijnaa.2022.6452
MLA
Idan,M K., and Abdlhusein,M A.. "Different types of dominating sets of the discrete topological graph", International Journal of Nonlinear Analysis and Applications, 14, 1, 2023, 101-108. doi: 10.22075/ijnaa.2022.6452
HARVARD
Idan M K., Abdlhusein M A.. (2023). 'Different types of dominating sets of the discrete topological graph', International Journal of Nonlinear Analysis and Applications, 14(1), pp. 101-108. doi: 10.22075/ijnaa.2022.6452
CHICAGO
M K. Idan and M A. Abdlhusein, "Different types of dominating sets of the discrete topological graph," International Journal of Nonlinear Analysis and Applications, 14 1 (2023): 101-108, doi: 10.22075/ijnaa.2022.6452
VANCOUVER
Idan M K., Abdlhusein M A.. Different types of dominating sets of the discrete topological graph. IJNAA. 2023;14(1):101-108. doi: 10.22075/ijnaa.2022.6452
International Journal of Nonlinear Analysis and Applications