×

You are using an outdated browser Internet Explorer. It does not support some functions of the site.

Recommend that you install one of the following browsers: Firefox, Opera or Chrome.

Contacts:

+7 961 270-60-01
ivdon3@bk.ru

Determination dominating set intuitionistic fuzzy graph

Abstract

Determination dominating set intuitionistic fuzzy graph

Bozhenyuk A.V., Belyakov S.L., Kosenko O.V., Alekhina O.M.

Incoming article date: 07.05.2019

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 considered. 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. The considered method and algorithm can be used to find other invariants, in particular, externally stable set, intuitionistic base and antibase of the intuitionistic fuzzy graphs.

Keywords: intuitionistic fuzzy set, degree of belonging, degree of non-belonging, fuzzy relation, intuitionistic fuzzy graph, intuitionistic fuzzy graph of the first kind, domination set, algorithm, disjunctive member, adjacency matrix