Analysis of the Shortest Path in Spherical Fuzzy Networks Using the Novel Dijkstra Algorithm. (27th September 2021)

• Record Type: Journal Article
• Authors: Ullah, Zafar; Bashir, Huma; Anjum, Rukhshanda; AlQahtani, Salman A.; Al-Hadhrami, Suheer; Ghaffar, Abdul
• Other Names: Jan Naeem Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2021(2021)
• Publication Date: 2021-09-27
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2021/7946936
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : The concept of fuzzy graph (FG) and its generalized forms has been developed to cope with several real-life problems having some sort of imprecision like networking problems, decision making, shortest path problems, and so on. This paper is based on some developments in generalization of FG theory to deal with situation where imprecision is characterized by four types of membership grades. A novel concept of T-spherical fuzzy graph (TSFG) is proposed as a common generalization of FG, intuitionistic fuzzy graph (IFG), and picture fuzzy graph (PFG) based on the recently introduced concept of T-spherical fuzzy set (TSFS). The significance and novelty of proposed concept is elaborated with the help of some examples, graphical analysis, and results. Some graph theoretic terms are defined and their properties are studied. Specially, the famous Dijkstra algorithm is proposed in the environment of TSFGs and is applied to solve a shortest path problem. The comparative analysis of the proposed concept and existing theory is made. In addition, the advantages of the proposed work are discussed over the existing tools.