This paper deals with an inspiring and real-world problem of mining maximal cliques in an intuitionistic fuzzy graph G where the edges are weighted by the degrees of membership together with non-membership values. By using fuzzy cuts ( α , β ) such that 0 ≤ αβ ≤ 1, a modiﬁed concept of C αβ maximal clique is proposed in an intuitionistic fuzzy graph. To ﬁnd C αβ maximal cliques in an intuitionistic fuzzy graph, we present an effective mining algorithm based on this C αβ is introduced.
Digital Object Identifier (DOI)
Venkatesh, S. and Sujatha, S.
"Mining Maximal Cliques through an Intuitionistic Fuzzy Graph,"
Applied Mathematics & Information Sciences: Vol. 11
, Article 26.
Available at: https://dc.naturalspublishing.com/amis/vol11/iss4/26