Branch Mathematics and Statistics Faculty and Staff Publications
Document Type
Article
Publication Date
11-2016
Abstract
In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosophic number. The proposed algorithm gives the shortest path length using score function from source node to destination node. Here the weights of the edges are considered to be single valued trapezoidal neutrosophic number. Finally, a numerical example is used to illustrate the efficiency of the proposed approach
Publication Title
Proceedings of the 2016 International Conference on Advanced Mechatronic Systems, Melbourne, Australia, November 30 - December 3, 2016
DOI
http://doi.org/10.5281/zenodo.888855
Language (ISO)
English
Keywords
Single valued trapezoidal neutrosophic number; Score function; Network; Shortest path problem
Recommended Citation
Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, & Luige Vladareanu. (2016). Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers. In Proceedings of the 2016 International Conference on Advanced Mechatronic Systems, Melbourne, Australia, November 30 - December 3, 2016. 6 pages. http://doi.org/10.5281/zenodo.888855
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Included in
Logic and Foundations Commons, OS and Networks Commons, Other Computer Sciences Commons, Other Mathematics Commons, Set Theory Commons
