General Mathematics


Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information

Authors: Said Broumi, Mohamed Talea, Assia Bakali, Florentin Smarandache, Luige VlĂdĂreanu

In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach.

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2017-01-11 06:04:50

Unique-IP document downloads: 21 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