Results on Intuitionistic Fuzzy Labeling Graphs

Main Article Content

Paulraj Jayasimman I, Devi Murugesan, Vignesh S

Abstract

In this paper, the Properties of an Intuitionistic Fuzzy Labeling Graph (IFLG) is studied. A graph is said to be an IFLG if it has Intuitionistic fuzzy labeling. Here, Intuitionistic Fuzzy (IF) sub graphs, union, IF-bridges, IF- end vertices, IF- cut vertices and weakest arc of IFL graphs have been discussed. Number of weakest arc, IF-bridge, IF-cut vertex and end vertex of an Intuitionistic fuzzy labeling cycle has been found. Degrees of IF-cut vertex and IF-end vertex have been identified. Also it is proved that If G is a connected IFLG then there exists a strong path between every pair of vertices of G.

Article Details

Section
Articles