Bayburt ÜniversitesiBayburt ÜniversitesiAçık Erişim Arşivi · RDL Open

Shortest path problem under interval valued neutrosophic setting

MakaleAçık ErişimScopus SJRQ4

Özet

This 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.

Anahtar Kelimeler

Interval Valued Neutrosophic GraphScore FunctionShortest Path Problem
RDL Kalıcı Bağlantı (PID)
https://rdlopen.rawdatalibrary.net/r/bayburt/12370Resmi atıflarda kullanılan kalıcı adres
İndeks kayıtları
ScopusScopus
Kaydın indeks veri tabanlarındaki sayfası (aktarımda alınan kayıt numarasıyla). Erişim, indeksin kendi koşullarına bağlıdır.
Atıflar
Scopus
16
OpenAlex
11
Her kaynağın kendi saydığı toplam atıf; aktarım ve zenginleştirme sırasında alındı.
Tam Kayıt
AlanDeğerDil
dc.contributor.authorBroumi, Said
dc.contributor.authorBakali, Assia
dc.contributor.authorTalea, Mohamed
dc.contributor.authorSmarandache, Florentin
dc.contributor.authorKrishnan Kishore, K.P.
dc.contributor.authorŞahin, Rıdvan
dc.date.accessioned2026-10-29T19:09:29.782593634Z
dc.date.available2026-10-29T19:09:29.782593634Z
dc.date.issued2019
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.
dc.identifier.doi10.30534/ijatcse/2019/4081.12019
dc.identifier.endpage222
dc.identifier.issn2278-3091
dc.identifier.issue1
dc.identifier.scopus2-s2.0-85063743529
dc.identifier.startpage216
dc.identifier.urihttps://rdlopen.rawdatalibrary.net/r/bayburt/12370
dc.identifier.volume8
dc.language.isoen
dc.publisherWorld Academy of Research in Science and Engineering
dc.relation.ispartofInternational Journal of Advanced Trends in Computer Science and Engineering
dc.rightsinfo:eu-repo/semantics/openAccess
dc.subjectInterval Valued Neutrosophic Graph
dc.subjectScore Function
dc.subjectShortest Path Problem
dc.titleShortest path problem under interval valued neutrosophic setting
dc.typeArticle
rdl.citation.openalex11
rdl.citation.scopus16
rdl.oa.statusbronze
rdl.oa.urlhttps://doi.org/10.30534/ijatcse/2019/4081.12019
rdl.publication.statusretracted
rdl.scopus.quartileQ4
rdl.source.indexSCOPUS