Shortest Path Problem on Single Valued Neutrosophic Graphs

被引：0

作者：

Broumi, Said ^{[1
]}

Talea, Mohamed ^{[1
]}

Bakali, Assia ^{[2
]}

Smarandache, Florentin ^{[3
]}

Kumar, Kishore P. K. ^{[4
]}

机构：

[1] Univ Hassan 2, Fac Sci Ben MSik, Lab Informat Proc, BP 7955, Casablanca, Morocco

[2] Ecole Royale Navale, Blvd Sour Jdid,BP 16303, Casablanca, Morocco

[3] Univ New Mexico, Dept Math, 705 Gurley Ave, Gallup, NM 87301 USA

[4] Bharathiar Univ, Coimbatore 641046, Tamil Nadu, India

来源：

2017 INTERNATIONAL SYMPOSIUM ON NETWORKS, COMPUTERS AND COMMUNICATIONS (ISNCC) | 2017年

关键词：

Single valued neutrosophic sets; Single valued neutrosophic graph; Shortest path problem; FUZZY; SETS;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and intuitionistic fuzzy graphs. This paper addresses for the first time, the shortest path in an acyclic neutrosophic directed graph using ranking function. Here each edge length is assigned to single valued neutrosophic numbers instead of a real number. The neutrosophic number is able to represent the indeterminacy in the edge (arc) costs of neutrosophic graph. A proposed algorithm gives the shortest path and shortest path length from source node to destination node. Finally an illustrative example also included to demonstrate the proposed method in solving path problems with single valued neutrosophic arcs.

引用

页数：6

共 50 条

[1] Study on single-valued neutrosophic graph with application in shortest path problem
Liu, Ruxiang
CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY, 2020, 5 (04) : 308 - 313
[2] Neutrosophic Shortest Path Problem
Kumar, Ranjan
Edaltpanah, S. A.
Jha, Sripati
Broumi, Said
Dey, Arindam
NEUTROSOPHIC SETS AND SYSTEMS, 2018, 23 : 5 - 15
[3] The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
Said Broumi
Deivanayagampillai Nagarajan
Assia Bakali
Mohamed Talea
Florentin Smarandache
Malayalan Lathamaheswari
Complex & Intelligent Systems, 2019, 5 : 391 - 402
[4] The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
Broumi, Said
Nagarajan, Deivanayagampillai
Bakali, Assia
Talea, Mohamed
Smarandache, Florentin
Lathamaheswari, Malayalan
COMPLEX & INTELLIGENT SYSTEMS, 2019, 5 (04) : 391 - 402
[5] Application of Dijkstra Algorithm for Solving Interval Valued Neutrosophic Shortest Path Problem
Broumi, Said
Bakali, Assia
Talea, Mohamed
Smarandache, Florentin
PROCEEDINGS OF 2016 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2016,
[6] Single Valued Pentapartitioned Neutrosophic Graphs
Das, Suman
Das, Rakhal
Pramanik, Surapati
Neutrosophic Sets and Systems, 2022, 50 : 225 - 238
[7] Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm
Yang, Lehua
Li, Dongmei
Tan, Ruipu
IEEE Access, 2020, 8 : 88717 - 88728
[8] Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm
Yang, Lehua
Li, Dongmei
Tan, Ruipu
IEEE ACCESS, 2020, 8 : 88717 - 88728
[9] Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph
Biswas, Siddhartha Sankar
NEUTROSOPHIC SETS AND SYSTEMS, 2019, 29 : 174 - 185
[10] SINGLE-VALUED NEUTROSOPHIC LINE GRAPHS
Naz, S.
Malik, M. A.
TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2018, 8 (02): : 483 - 494

← 1 2 3 4 5 →