Read Books Online and Download eBooks, EPub, PDF, Mobi, Kindle, Text Full Free.
Study On Single Valued Neutrosophic Graph With Application In Shortest Path Problem
Download Study On Single Valued Neutrosophic Graph With Application In Shortest Path Problem full books in PDF, epub, and Kindle. Read online Study On Single Valued Neutrosophic Graph With Application In Shortest Path Problem ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Book Synopsis Study on single-valued neutrosophic graph with application in shortest path problem by : Ruxiang Liu
Download or read book Study on single-valued neutrosophic graph with application in shortest path problem written by Ruxiang Liu and published by Infinite Study. This book was released on with total page 6 pages. Available in PDF, EPUB and Kindle. Book excerpt: Fuzzy set and neutrosophic set are two efficient tools to handle the uncertainties and vagueness of any real-world problems. Neutrosophic set is more useful than fuzzy set (intuitionistic fuzzy sets) to manage the uncertainties of a real-life problem. This study introduces some new concepts of single-valued neutrosophic graph (SVNG). The authors have discussed the definition of regular SVNG, complete SVNG and strong SVNG. The shortest path problem is a well-known combinatorial optimisation problem in the field of graph theory due to its various applications. Uncertainty is present in almost every application of shortest path problem which makes it very hard to decide the edge weight properly.
Book Synopsis Shortest Path Problem on Single Valued Neutrosophic Graphs by : Said Broumi
Download or read book Shortest Path Problem on Single Valued Neutrosophic Graphs written by Said Broumi and published by Infinite Study. This book was released on with total page 6 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Shortest Path Problem Under Interval Valued Neutrosophic Setting by : Said Broumi
Download or read book Shortest Path Problem Under Interval Valued Neutrosophic Setting written by Said Broumi and published by Infinite Study. This book was released on with total page 7 pages. Available in PDF, EPUB and Kindle. Book excerpt: This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here each arc length is assigned to interval valued neutrosophic number. Finally, a numerical example has been provided for illustrating the proposed approach.
Book Synopsis Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm by : Lehua Yang
Download or read book Research on the Shortest Path Solution Method of Interval Valued Neutrosophic Graphs Based on the Ant Colony Algorithm written by Lehua Yang and published by Infinite Study. This book was released on with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm by : S. Krishna Prabha
Download or read book Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm written by S. Krishna Prabha and published by Infinite Study. This book was released on 2020-10-01 with total page 9 pages. Available in PDF, EPUB and Kindle. Book excerpt: Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc. are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function. A numerical example is used to illustrate the proposed approach.
Book Synopsis Operations on single valued neutrosophic graphs with application by : Sumera Naz
Download or read book Operations on single valued neutrosophic graphs with application written by Sumera Naz and published by Infinite Study. This book was released on with total page 15 pages. Available in PDF, EPUB and Kindle. Book excerpt: The concepts of graph theory are applied in many areas of computer science including image segmentation, data mining, clustering, image capturing and networking. Fuzzy graph theory is successfully used in many problems, to handle the uncertainty that occurs in graph theory. A single valued neutrosophic graph (SVNG) is an instance of a neutrosophic graph and a generalization of the fuzzy graph, intuitionistic fuzzy graph, and interval-valued intuitionistic fuzzy graph. In this paper, the basic operations on SVNGs such as direct product, Cartesian product, semi-strong product, strong product, lexicographic product, union, ring sum and join are defined. Moreover, the degree of a vertex in SVNGs formed by these operations in terms of the degree of vertices in the given SVNGs in some particular cases are determined. Finally, an application of single valued neutrosophic digraph (SVNDG) in traval time is provided.
Book Synopsis Shortest path on interval-valued nether trapezoidal neutrosophic fuzzy graphs by : K. Kalaiarasi
Download or read book Shortest path on interval-valued nether trapezoidal neutrosophic fuzzy graphs written by K. Kalaiarasi and published by Infinite Study. This book was released on with total page 5 pages. Available in PDF, EPUB and Kindle. Book excerpt: The concept of this research is introduced to interval-valued trapezoidal neutrosophic fuzzy graph which is combined to trapezoidal fuzzy numbers and interval-valued neutrosophic fuzzy graph. In this analysis, proposed algorithm finds source node and destination node because of the shortest path problem. In this research, we apply trapezoidal number with interval-valued neutrosophic fuzzy graph and finding their score function. Eventually an illustrative example to explain, to easy way of shortest path fuzzy graph.
Book Synopsis Shortest path problem using Bellman algorithm under neutrosophic environment by : Said Broumi
Download or read book Shortest path problem using Bellman algorithm under neutrosophic environment written by Said Broumi and published by Infinite Study. This book was released on with total page 8 pages. Available in PDF, EPUB and Kindle. Book excerpt: An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.
Book Synopsis Certain Single-Valued Neutrosophic Graphs with Application by : Muhammad Akram
Download or read book Certain Single-Valued Neutrosophic Graphs with Application written by Muhammad Akram and published by Infinite Study. This book was released on with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this research paper, we present certain types of single-valued neutrosophic graphs, including edge regular single-valued neutrosophic graphs and totally edge regular single-valued neutrosophic graphs. We investigate some of their related properties. We describe an application of single-valued neutrosophic graph in decision making process and present the procedure of our method that is used in our application in an algorithm.
Book Synopsis Constant single valued neutrosophic graphs with applications by : Naeem Jan
Download or read book Constant single valued neutrosophic graphs with applications written by Naeem Jan and published by Infinite Study. This book was released on with total page 13 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we introduced a new concept of single valued neutrosophic graph (SVNG) known as constant single valued neutrosophic graph (CSVNG). Basically, SVNG is a generalization of intuitionistic fuzzy graph (IFG). More specifically, we described and explored somegraph theoretic ideas related to the introduced concepts of CSVNG. An application of CSVNG in a Wi-Fi network system is discussed and a comparison of CSVNG with constant IFG is established showing the worth of the proposed work. Further, several terms like constant function and totally constant function are investigated in the frame-work of CSVNG and their characteristics are studied.
Book Synopsis Neutrosophic Shortest Path Problem by : Ranjan Kumar
Download or read book Neutrosophic Shortest Path Problem written by Ranjan Kumar and published by Infinite Study. This book was released on with total page 11 pages. Available in PDF, EPUB and Kindle. Book excerpt: Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to each edge as its edge cost. We define this problem as neutrosophic shortest path problem (NSSPP). A simple algorithm is also introduced to solve the NSSPP. The proposed algorithm finds the neutrosophic shortest path (NSSP) and its corresponding neutrosophic shortest path length (NSSPL) between source node and destination node.
Book Synopsis The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment by : Said Broumi
Download or read book The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment written by Said Broumi and published by Infinite Study. This book was released on with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem by : Said Broumi
Download or read book Applying Dijkstra Algorithm for Solving Neutrosophic Shortest Path Problem written by Said Broumi and published by Infinite Study. This book was released on with total page 5 pages. Available in PDF, EPUB and Kindle. Book excerpt: The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network.
Book Synopsis Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm by : Lehua Yang
Download or read book Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle‐Breaking Algorithm written by Lehua Yang and published by Infinite Study. This book was released on with total page 22 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
Book Synopsis Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers by : Said Broum
Download or read book Computation of Shortest Path Problem in a Network with SV-Trapezoidal Neutrosophic Numbers written by Said Broum and published by Infinite Study. This book was released on with total page 6 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this work, a neutrosophic network method is proposed for finding the shortest path length with single valued trapezoidal neutrosophic number. The proposed algorithm gives the shortest path length using score function from source node to destination node. Here the weights of the edges are considered to be single valued trapezoidal neutrosophic number. Finally, a numerical example is used to illustrate the efficiency of the proposed approach.
Book Synopsis An Isolated Interval Valued Neutrosophic Graph by : Said Broumi
Download or read book An Isolated Interval Valued Neutrosophic Graph written by Said Broumi and published by Infinite Study. This book was released on with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt: The interval valued neutrosophic graphs are generalizations of the fuzzy graphs, interval fuzzy graphs, interval valued intuitionstic fuzzy graphs, and single valued neutrosophic graphs. Previously, several results have been proved on the isolated graphs and the complete graphs. In this paper, a necessary and sufficient condition for an interval valued neutrosophic graph to be an isolated interval valued neutrosophic graph is proved.
Book Synopsis Neutrosophic Graph Theory and Algorithms by : Smarandache, Florentin
Download or read book Neutrosophic Graph Theory and Algorithms written by Smarandache, Florentin and published by IGI Global. This book was released on 2019-10-25 with total page 406 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
