Different types of dominating sets of the discrete topological graph

	Different types of dominating sets of the discrete topological graph
International Journal of Nonlinear Analysis and Applications
مقاله 10، دوره 14، شماره 1، فروردین 2023، صفحه 101-108 اصل مقاله (711.11 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2022.6452
نویسندگان
Mays K. Idan؛ Mohammed A. Abdlhusein^*
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.
کلیدواژه‌ها
Independent domination؛ doubly connected domination؛ total domination؛ restrained domination
آمار تعداد مشاهده مقاله: 19,155 تعداد دریافت فایل اصل مقاله: 13,584

پیوندهای مفید

آمار