Neutrosophic Graph Theory And Algorithms
Download Neutrosophic Graph Theory And Algorithms full books in PDF, epub, and Kindle. Read online free Neutrosophic Graph Theory And Algorithms ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : Smarandache, Florentin |
| Publisher | : IGI Global |
| Total Pages | : 406 |
| Release | : 2019-10-25 |
| Genre | : Computers |
| ISBN | : 1799813150 |
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.
| Author | : Arindam Dey |
| Publisher | : Infinite Study |
| Total Pages | : 7 |
| Release | : |
| Genre | : |
| ISBN | : |
In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic number, instead of a real number/fuzzy number, is assigned to each arc as its arc length.We define this type of MST as neutrosophic minimum spanning tree (NMST).
| Author | : Said Broumi |
| Publisher | : Infinite Study |
| Total Pages | : 10 |
| Release | : |
| Genre | : |
| ISBN | : |
Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers.
| Author | : Said Broumi |
| Publisher | : Infinite Study |
| Total Pages | : 5 |
| Release | : |
| Genre | : |
| ISBN | : |
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.
| Author | : Yanhui Guo |
| Publisher | : Infinite Study |
| Total Pages | : 25 |
| Release | : |
| Genre | : |
| ISBN | : |
Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC).
| Author | : Ruxiang Liu |
| Publisher | : Infinite Study |
| Total Pages | : 6 |
| Release | : |
| Genre | : Mathematics |
| ISBN | : |
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.
| Author | : Lehua Yang |
| Publisher | : Infinite Study |
| Total Pages | : 22 |
| Release | : |
| Genre | : Mathematics |
| ISBN | : |
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.
| Author | : Lehua Yang |
| Publisher | : Infinite Study |
| Total Pages | : 22 |
| Release | : |
| Genre | : Mathematics |
| ISBN | : |
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.
| Author | : S. Broumi |
| Publisher | : Infinite Study |
| Total Pages | : 8 |
| Release | : |
| Genre | : |
| ISBN | : |
In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.
| Author | : Frank Werner |
| Publisher | : MDPI |
| Total Pages | : 294 |
| Release | : 2020-05-27 |
| Genre | : Technology & Engineering |
| ISBN | : 3039287982 |
Graph theory is an important area of applied mathematics with a broad spectrum of applications in many fields. This book results from aSpecialIssue in the journal Mathematics entitled “Graph-Theoretic Problems and Their New Applications”. It contains 20 articles covering a broad spectrum of graph-theoretic works that were selected from 151 submitted papers after a thorough refereeing process. Among others, it includes a deep survey on mixed graphs and their use for solutions ti scheduling problems. Other subjects include topological indices, domination numbers of graphs, domination games, contraction mappings, and neutrosophic graphs. Several applications of graph theory are discussed, e.g., the use of graph theory in the context of molecular processes.
