Mathematics and Statistics Faculty and Staff Publications

Document Type

Article

Publication Date

2017

Abstract

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.

First Page

1

Last Page

25

DOI

http://doi.org/10.5281/zenodo.888858

Language (ISO)

English

Keywords

single valued triangular neutrosophic number; score function function; network network; shortest shortest path problem

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Share

COinS