Shortest path problem under interval valued neutrosophic setting

Basit Öğe Kaydı
dc.authorid55919041000
dc.authorid57192556455
dc.authorid55542641500
dc.authorid6506230265
dc.authorid57208086736
dc.authorid56285350800
dc.contributor.authorBroumi S.
dc.contributor.authorBakali A.
dc.contributor.authorTalea M.
dc.contributor.authorSmarandache F.
dc.contributor.authorKrishnan Kishore K.P.
dc.contributor.authorŞahin R.
dc.date.accessioned20.04.201910:49:12
dc.date.accessioned2019-04-20T21:43:00Z
dc.date.available20.04.201910:49:12
dc.date.available2019-04-20T21:43:00Z
dc.date.issued2019
dc.departmentBayburt Üniversitesien_US
dc.description.abstractThis paper provides a research of the shortest neutrosophic path with interval valued neutrosophic numbers on a network. The suggested algorithm also provides the shortest path length utilizing ranking function from the source node to the destination node. Each of the arc lengths is attributed to an interval valued neutrosophic number. Lastly, we provide a numerical example to illustrate the suggested approach. © 2019, World Academy of Research in Science and Engineering. All rights reserved.en_US
dc.identifier.doi10.30534/ijatcse/2019/4081.12019
dc.identifier.issn2278-3091
dc.identifier.issue1
dc.identifier.scopus2-s2.0-85063743529en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://dx.doi.org/10.30534/ijatcse/2019/4081.12019
dc.identifier.urihttps://hdl.handle.net/20.500.12403/335
dc.identifier.volume8
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherWorld Academy of Research in Science and Engineering
dc.relation.ispartofInternational Journal of Advanced Trends in Computer Science and Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectInterval Valued Neutrosophic Graph
dc.subjectScore Function
dc.subjectShortest Path Problem
dc.subjectInterval Valued Neutrosophic Graph
dc.subjectScore Function
dc.subjectShortest Path Problem
dc.titleShortest path problem under interval valued neutrosophic settingen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu