Mining Maximal Cliques through an Intuitionistic Fuzzy Graph

Authors

S. Venkatesh, Department of Mathematics, J.J. College of Engineering and Technology, Tiruchirappalli, Tamil Nadu, IndiaFollow
S. Sujatha, Department of Computer Applications, University College of Engineering, BIT campus, Anna University, Tiruchirappalli, Tamil Nadu, IndiaFollow

Author Country (or Countries)

India

Abstract

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 modified concept of C αβ maximal clique is proposed in an intuitionistic fuzzy graph. To find C αβ maximal cliques in an intuitionistic fuzzy graph, we present an effective mining algorithm based on this C αβ is introduced.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/110426

Recommended Citation

Venkatesh, S. and Sujatha, S. (2017) "Mining Maximal Cliques through an Intuitionistic Fuzzy Graph," Applied Mathematics & Information Sciences: Vol. 11: Iss. 4, Article 26.
DOI: http://dx.doi.org/10.18576/amis/110426
Available at: https://digitalcommons.aaru.edu.jo/amis/vol11/iss4/26