Chapter

Theoretical Advances and Applications of Fuzzy Logic and Soft Computing

Volume 42 of the series Advances in Soft Computing pp 3-10

An Intuitionistic Fuzzy Graph Method for Finding the Shortest Paths in Networks

  • M. G. KarunambigaiAffiliated withDepartment of Mathematics, Vellalar College for Women, Erode, TN, 638 009
  • , Parvathi RangasamyAffiliated withDepartment of Mathematics, Vellalar College for Women, Erode, TN, 638 009
  • , Krassimir AtanassovAffiliated withCLBME – Bulgarian Academy of Sciences, P.O. Box 12, Sofia – 1113
  • , N. PalaniappanAffiliated withDepartment of Mathematics, Alagappa University, Karaikudi, TN, 630 003

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The task of finding shortest paths in graphs has been studied intensively over the past five decades. Shortest paths are one of the simplest and most widely used concepts in networks. More recently, fuzzy graphs, along with generalizations of algorithms for finding optimal paths within them, have emerged as an adequate modeling tool for imprecise systems. Fuzzy shortest paths also have a variety of applications. In this paper, the authors present a model based on dynamic programming to find the shortest paths in intuitionistic fuzzy graphs.

Keywords

Index Matrix (IM) Intuitionistic Fuzzy Graphs (IFGs) Shortest path Dynamic programming (DP)