Degree of a Vertex in Max-Product of Intuitionistic Fuzzy Graph

Abstract

Graph theory has applications in many areas of computer science, including data mining, image segmentation, clustering and networking. Product on graphs has a wide range of application in networking system, automata theory, game theory and structural mechanics. In many cases, some aspects of a graph-theoretic problem may be uncertain. Intuitionistic fuzzy models provide more compatible to the system compared to the fuzzy models. An intuitionistic fuzzy graph can be derived from two given intuitionistic fuzzy graphs using max-product. In this paper, we studied the degree of vertex in intuitionistic fuzzy graph by the max-product of two given intuitionistic fuzzy graph. Also find the necessary and sufficient condition for max-product of two intuitionistic fuzzy graphs to be regular.