A New Algorithm For Finding Minimum Spanning Trees With Undirected Neutrosophic Graphs
Download A New Algorithm For Finding Minimum Spanning Trees With Undirected Neutrosophic Graphs PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get A New Algorithm For Finding Minimum Spanning Trees With Undirected Neutrosophic Graphs book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
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).
Neutrosophic Graph Theory and Algorithms
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.
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results.