Shortest Path On Interval-Valued Triangular Neutrosophic Fuzzy Graphs With Application

Shortest Path On Interval-Valued Triangular Neutrosophic Fuzzy Graphs With Application
Author: K. Kalaiarasi
Publisher: Infinite Study
Total Pages: 14
Release:
Genre: Mathematics
ISBN:
GET BOOK

In this article, inaugurate interval-valued triangular neutrosophic fuzzy graph (IVTNFG) of SPP, which is drew on three-sided numbers and IVTNFG. Hear a genuine application is given an illustrative model for IVTNFG. Additionally Shortest way is determined for this model. This present Dijkstra's Algorithm briefest way was checked through Python Jupiter Notebook (adaptation) programming.

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle-Breaking Algorithm

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle-Breaking Algorithm
Author: Lehua Yang
Publisher: Infinite Study
Total Pages: 22
Release:
Genre: Mathematics
ISBN:
GET BOOK

The shortest path problem is a topic of increasing interest in various scientific fields. The damage to roads and bridges caused by disasters makes traffic routes that can be accurately expressed become indeterminate. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership of the constituent elements. It has a symmetric form and indeterminacy membership is their axis of symmetry. In uncertain environments, the neutrosophic number can more effectively express the edge distance.

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment
Author: Said Broumi
Publisher: Infinite Study
Total Pages: 14
Release:
Genre: Mathematics
ISBN:
GET BOOK

Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.

International Journal of Neutrosophic Science (IJNS) Volume 11, 2020

International Journal of Neutrosophic Science (IJNS) Volume 11, 2020
Author: Broumi Said
Publisher: Infinite Study
Total Pages: 114
Release:
Genre: Mathematics
ISBN:
GET BOOK

International Journal of Neutrosophic Science (IJNS) is a peer-review journal publishing high quality experimental and theoretical research in all areas of Neutrosophic and its Applications. Papers concern with neutrosophic logic and mathematical structures in the neutrosophic setting. Besides providing emphasis on topics like artificial intelligence, pattern recognition, image processing, robotics, decision making, data analysis, data mining, applications of neutrosophic mathematical theories contributions to economics, finance, management, industries, electronics, and communications are promoted.

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm

Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm
Author: Lehua Yang
Publisher: Infinite Study
Total Pages: 22
Release:
Genre: Mathematics
ISBN:
GET BOOK

The shortest path problem is a topic of increasing interest in various scientific fields. The damage to roads and bridges caused by disasters makes traffic routes that can be accurately expressed become indeterminate. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership of the constituent elements. It has a symmetric form and indeterminacy membership is their axis of symmetry.

Neutrosophic Graph Theory and Algorithms

Neutrosophic Graph Theory and Algorithms
Author: Smarandache, Florentin
Publisher: IGI Global
Total Pages: 406
Release: 2019-10-25
Genre: Computers
ISBN: 1799813150
GET BOOK

Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.

Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm

Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm
Author: Lehua Yang
Publisher: Infinite Study
Total Pages: 17
Release:
Genre: Mathematics
ISBN:
GET BOOK

The shortest path problem (SPP) is considerably important in several fields. After typhoons, the resulting damage leads to uncertainty regarding the path weight that can be expressed accurately. A neutrosophic set is a collection of the truth membership, indeterminacy membership, and falsity membership degrees of the elements. In an uncertain environment, neutrosophic numbers can express the edge distance more effectively.

Neutrosophic Set in Medical Image Analysis

Neutrosophic Set in Medical Image Analysis
Author: Yanhui Guo
Publisher: Academic Press
Total Pages: 372
Release: 2019-08-08
Genre: Computers
ISBN: 0128181494
GET BOOK

Neutrosophic Set in Medical Image Analysis gives an understanding of the concepts of NS, along with knowledge on how to gather, interpret, analyze and handle medical images using NS methods. It presents the latest cutting-edge research that gives insight into neutrosophic set's novel techniques, strategies and challenges, showing how it can be used in biomedical diagnoses systems. The neutrosophic set (NS), which is a generalization of fuzzy set, offers the prospect of overcoming the restrictions of fuzzy-based approaches to medical image analysis. - Introduces the mathematical model and concepts of neutrosophic theory and methods - Highlights the different techniques of neutrosophic theory, focusing on applying the neutrosophic set in image analysis to support computer- aided diagnosis (CAD) systems, including approaches from soft computing and machine learning - Shows how NS techniques can be applied to medical image denoising, segmentation and classification - Provides challenges and future directions in neutrosophic set based medical image analysis

Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph

Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph
Author: Siddhartha Sankar Biswas
Publisher: Infinite Study
Total Pages: 12
Release:
Genre: Mathematics
ISBN:
GET BOOK

One of the important non-linear data structures in Computer Science is graph. Most of the real life network, be it a road transportation network, or airlines network or a communication network etc., cannot be exactly transformed into a graph model, but into a Multigraphs model. The Multigraph is a topological generalization of the graph where multiple links (or edges/arcs) mayexist between two nodes unlike in graph.

Collected Papers. Volume VIII

Collected Papers. Volume VIII
Author: Florentin Smarandache
Publisher: Infinite Study
Total Pages: 1002
Release: 2022-04-01
Genre: Mathematics
ISBN:
GET BOOK

This eighth volume of Collected Papers includes 75 papers comprising 973 pages on (theoretic and applied) neutrosophics, written between 2010-2022 by the author alone or in collaboration with the following 102 co-authors (alphabetically ordered) from 24 countries: Mohamed Abdel-Basset, Abduallah Gamal, Firoz Ahmad, Ahmad Yusuf Adhami, Ahmed B. Al-Nafee, Ali Hassan, Mumtaz Ali, Akbar Rezaei, Assia Bakali, Ayoub Bahnasse, Azeddine Elhassouny, Durga Banerjee, Romualdas Bausys, Mircea Boșcoianu, Traian Alexandru Buda, Bui Cong Cuong, Emilia Calefariu, Ahmet Çevik, Chang Su Kim, Victor Christianto, Dae Wan Kim, Daud Ahmad, Arindam Dey, Partha Pratim Dey, Mamouni Dhar, H. A. Elagamy, Ahmed K. Essa, Sudipta Gayen, Bibhas C. Giri, Daniela Gîfu, Noel Batista Hernández, Hojjatollah Farahani, Huda E. Khalid, Irfan Deli, Saeid Jafari, Tèmítópé Gbóláhàn Jaíyéolá, Sripati Jha, Sudan Jha, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, M. Karthika, Kawther F. Alhasan, Giruta Kazakeviciute-Januskeviciene, Qaisar Khan, Kishore Kumar P K, Prem Kumar Singh, Ranjan Kumar, Maikel Leyva-Vázquez, Mahmoud Ismail, Tahir Mahmood, Hafsa Masood Malik, Mohammad Abobala, Mai Mohamed, Gunasekaran Manogaran, Seema Mehra, Kalyan Mondal, Mohamed Talea, Mullai Murugappan, Muhammad Akram, Muhammad Aslam Malik, Muhammad Khalid Mahmood, Nivetha Martin, Durga Nagarajan, Nguyen Van Dinh, Nguyen Xuan Thao, Lewis Nkenyereya, Jagan M. Obbineni, M. Parimala, S. K. Patro, Peide Liu, Pham Hong Phong, Surapati Pramanik, Gyanendra Prasad Joshi, Quek Shio Gai, R. Radha, A.A. Salama, S. Satham Hussain, Mehmet Șahin, Said Broumi, Ganeshsree Selvachandran, Selvaraj Ganesan, Shahbaz Ali, Shouzhen Zeng, Manjeet Singh, A. Stanis Arul Mary, Dragiša Stanujkić, Yusuf Șubaș, Rui-Pu Tan, Mirela Teodorescu, Selçuk Topal, Zenonas Turskis, Vakkas Uluçay, Norberto Valcárcel Izquierdo, V. Venkateswara Rao, Volkan Duran, Ying Li, Young Bae Jun, Wadei F. Al-Omeri, Jian-qiang Wang, Lihshing Leigh Wang, Edmundas Kazimieras Zavadskas.