登入選單

返回Google圖書搜尋

Shortest Path Problem Under Interval Valued Neutrosophic Setting

Said BroumiAssia BakaliMohamed TaleaFlorentin SmarandacheP. Krishnan KishoreRıdvan Şahin

出版	Infinite Study
主題	Mathematics / Applied
URL	http://books.google.com.hk/books?id=HFbVDwAAQBAJ&hl=&source=gbs_api
EBook	SAMPLE

註釋

This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here each arc length is assigned to interval valued neutrosophic number. Finally, a numerical example has been provided for illustrating the proposed approach.