Informatics Publishing Limited

A. Nagoor Gani ¹, S. Shajitha Begum ¹

Affiliations
1 Department of Mathematics, Jamal Mohamed College (autonomous), Trichy - 620020, Tamil Nadu, IN

Abstract

In this paper, some properties of self complementary intuitionistic fuzzy graphs and self weak complementary intuitionistic fuzzy graphs are discussed. Busy nodes and free nodes in intuitionistic fuzzy graphs are defined and the properties of nodes are examined at various levels of their degrees. Busy value of a node and the graph are defined and some of its properties are studied.

Keywords

Busy Node, Free Node, Partial Busy Node and Partial Free Node.

Full Text

     

A. Nagoor Gani ¹, M. Mohammed Jabarulla ¹

Affiliations
1 Department of Mathematics, Jamal Mohamed College (Autonomous), Tiruchirappalli-620020, Tamilnadu, IN

Abstract

This paper presents an intuitionistic fuzzy shortest length procedure is proposed for triangular and trapezoidal intuitionistic fuzzy number to find the shortest length in an intuitionistic fuzzy graph which is an intuitionistic fuzzy number, instead of a fuzzy number is assigned to each arc length. An existing algorithm is extended to find the shortest length and using similarity measure to find the shortest path. At last, some numerical examples are given to illustrate this method.

Keywords

Intuitionistic Fuzzy Set (IFS), Intuitionistic Fuzzy Graph (IFG), Intuitionistic Fuzzy Number (IFN), Similarity Measure.

Full Text