Autor:	Broumi, Said, Bakali, Assia, K. P. Krishnan Kishore
Rok vydání:	2018
Předmět:	Mathematics::General Mathematics
DOI:	10.6084/m9.figshare.7048553.v1
Popis:	This paper presents a study of neutrosophic shortestpath with interval valued neutrosophic number on a network. Aproposed algorithm also gives the shortest path length usingranking function from source node to destination node. Hereeach arc length is assigned to interval valued neutrosophicnumber. Finally, a numerical example has been provided forillustrating the proposed approach.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::343553e532d3c3cc88ce5f3af54de99b Zobrazit plný text záznamu