General Mathematics


Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers

Authors: Said Broumi, Mohamed Talea, Florentin Smarandache, Assia Bakali, Luige Vladareanu

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.

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2017-05-29 08:53:23

Unique-IP document downloads: 5 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus