A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
Title | A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs PDF eBook |
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).
Spanning Tree Problem with Neutrosophic Edge Weights
Title | Spanning Tree Problem with Neutrosophic Edge Weights PDF eBook |
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. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finally a numerical example is provided
A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph
Title | A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph PDF eBook |
Author | Said Broumi |
Publisher | Infinite Study |
Total Pages | 16 |
Release | |
Genre | |
ISBN |
In this chapter, we introduce a new algorithm for finding a minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph whose edge weights are represented by an interval valued neutrosophic number.
Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs
Title | Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs PDF eBook |
Author | G. Upender Reddy |
Publisher | Infinite Study |
Total Pages | 15 |
Release | |
Genre | Mathematics |
ISBN |
The minimal spanning tree (MST) algorithms by using the edges weights were presented mainly by Prim’s and Kruskal’s algorithms. In this article we use the weights for the bipolar neutrosophic edges by using the score functions with the new model algorithms namely bipolar neutrosophic Prim’s algorithm and bipolar neutrosophic Kruskal’s algorithm. Further, we use the score functions to get the more appropriate results based on the algorithms.
Neutrosophic Graph Theory and Algorithms
Title | Neutrosophic Graph Theory and Algorithms PDF eBook |
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.
Bipolar Neutrosophic Minimum Spanning Tree
Title | Bipolar Neutrosophic Minimum Spanning Tree PDF eBook |
Author | Said Broumi |
Publisher | Infinite Study |
Total Pages | 6 |
Release | |
Genre | |
ISBN |
The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG).
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
Title | A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications PDF eBook |
Author | Liangsong Huang |
Publisher | Infinite Study |
Total Pages | 20 |
Release | |
Genre | Mathematics |
ISBN |
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.