Work

Shortest path problem on single valued neutrosophic graphs

Year: 2017

Type: conference-paper

Abstract: A single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and intuitionistic fuzzy graphs. This paper addresses for the first time, the shortest path in an acyclic neutrosophic directed graph using ranking function. Here each edge length is assigned to single valued neutrosophic numbers instead of a real number. The neutrosophic number is able to represent the indeterminacy in the edge (arc) costs of neutrosophic graph. A proposed algorithm gives the shortest path and shortest path length from source node to destination node. Finally an illustrative example also included to demonstrate the proposed method in solving path problems with single valued neutrosophic arcs.

Source: International Symposium on Networks, Computers and Communications (ISNCC)

DOI: 10.1109/isncc.2017.8071993

Authors: Said Broumi, Mohamed Talea, Assia Bakali, Florentin Smarandache, P. K Kishore Kumar

Institutions: University of Hassan II Casablanca, École Royale Navale, University of New Mexico, Bharathiar University

Language: English

Topic: Fuzzy and Soft Set Theory

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: green

OpenAlex ID: W2766076982

FWCI: 12.05

Cites: 43

Cited by: 48

Related to: 10