Spanning Tree Problem with Neutrosophic Edge Weights
Download or Read eBook Spanning Tree Problem with Neutrosophic Edge Weights PDF written by Said Broumi and published by Infinite Study. This book was released on with total page 10 pages. Available in PDF, EPUB and Kindle.
| Author | : Said Broumi |
| Publisher | : Infinite Study |
| Total Pages | : 10 |
| Release | : |
| ISBN-10 | : |
| ISBN-13 | : |
| Rating | : 4/5 ( Downloads) |
Book Synopsis Spanning Tree Problem with Neutrosophic Edge Weights by : Said Broumi
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.
