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
关键词
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 条
  • [21] Accessible single-valued neutrosophic graphs
    Hamidi, M.
    Saeid, A. Borumand
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2018, 57 (1-2) : 121 - 146
  • [22] SPECIAL TYPES OF SINGLE VALUED NEUTROSOPHIC GRAPHS
    Hassan, A.
    Malik, M. A.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2018, 8 (02): : 341 - 352
  • [23] Complementary domination in Single valued neutrosophic graphs
    Ramya, R.
    Vinothkumar, N.
    Karuppasamy, E.
    MATERIALS TODAY-PROCEEDINGS, 2021, 47 : 2076 - 2079
  • [24] Calculation of Fuzzy shortest path problem using Multi-valued Neutrosophic number under fuzzy environment
    Raut P.K.
    Behera S.P.
    Broumi S.
    Mishra D.
    Neutrosophic Sets and Systems, 2023, 57 : 356 - 369
  • [25] Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    Vladareanu, Luige
    2016 INTERNATIONAL CONFERENCE ON ADVANCED MECHATRONIC SYSTEMS (ICAMECHS), 2016, : 412 - 416
  • [26] Shortest Path Problem Under Triangular Fuzzy Neutrosophic Information
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    PROCEEDINGS OF 2016 10TH INTERNATIONAL CONFERENCE ON SOFTWARE, KNOWLEDGE, INFORMATION MANAGEMENT & APPLICATIONS (SKIMA), 2016, : 169 - 174
  • [27] Single Valued Neutrosophic Graphs: Degree, Order and Size
    Broumi, Said
    Talea, Mohamed
    Smarandache, Florentin
    Bakali, Assia
    2016 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ-IEEE), 2016, : 2444 - 2451
  • [28] On single-valued co-neutrosophic graphs
    Dhavaseelan, R.
    Jafari, S.
    Farahani, M. R.
    Broumi, S.
    NEUTROSOPHIC SETS AND SYSTEMS, 2018, 22 : 180 - 187
  • [29] An Isolated Bipolar Single-Valued Neutrosophic Graphs
    Broumi, Said
    Bakali, Assia
    Talea, Mohamed
    Smarandache, Florentin
    INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, INDIA 2017, 2018, 672 : 816 - 822
  • [30] An algorithmic framework for the single source shortest path problem with applications to disk graphs
    Klost, Katharina
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2023, 111