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.
International Symposium on Networks, Computers and Communications (ISNCC-2017), Marrakech, Morocco, May 16-18, 2017, www.isncc-conf.org
Single valued neutrosophic sets; Single valued neutrosophic graph; Shortest path problem
Smarandache, Florentin; Said Broumi; Mohamed Talea; Assia Bakali; and Kishore Kumar. "Shortest Path Problem on Single Valued Neutrosophic Graphs." International Symposium on Networks, Computers and Communications (ISNCC-2017), Marrakech, Morocco, May 16-18, 2017, www.isncc-conf.org (2017). https://digitalrepository.unm.edu/math_fsp/418
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.