Algorithm for Finding Domination Set in Intuitionistic Fuzzy Graph
Authors
Alexander Bozhenyuk, Margarita Knyazeva, Igor Rozenberg
Corresponding Author
Alexander Bozhenyuk
Available Online August 2019.
- DOI
- 10.2991/eusflat-19.2019.11How to use a DOI?
- Keywords
- Intuitionistic fuzzy set Intuitionistic fuzzy graph Minimal intuitionistic dominating vertex subset Domination set
- Abstract
In this paper, the concept of minimal intuitionistic dominating vertex subset of intuitionistic fuzzy graph was considered, and on its basis the notion of a domination set as an invariant of the intuitionistic fuzzy graph was introduced. A method and an algorithm for finding all minimal intuitionistic dominating vertex subset and domination set were proposed. This method is the generalization of Maghout’s method for fuzzy graphs. The example of finding the domination set of the intuitionistic fuzzy graph was considered as well.
- Copyright
- © 2019, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Alexander Bozhenyuk AU - Margarita Knyazeva AU - Igor Rozenberg PY - 2019/08 DA - 2019/08 TI - Algorithm for Finding Domination Set in Intuitionistic Fuzzy Graph BT - Proceedings of the 11th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2019) PB - Atlantis Press SP - 72 EP - 76 SN - 2589-6644 UR - https://doi.org/10.2991/eusflat-19.2019.11 DO - 10.2991/eusflat-19.2019.11 ID - Bozhenyuk2019/08 ER -