Share

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 Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs by : Arindam Dey

Download or read book A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs written by Arindam Dey. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: 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

Download Spanning Tree Problem with Neutrosophic Edge Weights PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Spanning Tree Problem with Neutrosophic Edge Weights by : Said Broumi

Download or read book Spanning Tree Problem with Neutrosophic Edge Weights written by Said Broumi . This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: 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

Download A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph by : Said Broumi

Download or read book A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph written by Said Broumi. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: 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.

Neutrosophic Graph Theory and Algorithms

2019-10-25 Computers
Download Neutrosophic Graph Theory and Algorithms PDF Online Free

Author :
Release : 2019-10-25
Genre : Computers
Kind : eBook
Book Rating : 150/5 ( reviews)

GET EBOOK


Book Synopsis Neutrosophic Graph Theory and Algorithms by : Smarandache, Florentin

Download or read book Neutrosophic Graph Theory and Algorithms written by Smarandache, Florentin. This book was released on 2019-10-25. 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.

Bipolar Neutrosophic Minimum Spanning Tree

Download Bipolar Neutrosophic Minimum Spanning Tree PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Bipolar Neutrosophic Minimum Spanning Tree by : Said Broumi

Download or read book Bipolar Neutrosophic Minimum Spanning Tree written by Said Broumi. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: 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).

You may also like...