Study on single-valued neutrosophic graph with application in shortest path problem
Author: Ruxiang Liu
Publisher: Infinite Study
Published:
Total Pages: 6
ISBN-13:
DOWNLOAD EBOOK →This study introduces some new concepts of single-valued neutrosophic graph (SVNG). The authors have discussed the definition of regular SVNG, complete SVNG and strong SVNG. The shortest path problem is a well-known combinatorial optimisation problem in the field of graph theory due to its various applications. Uncertainty is present in almost every application of shortest path problem which makes it very hard to decide the edge weight properly.