A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
| Author | : Arindam Dey |
| Publisher | : Infinite Study |
| Total Pages | : 7 |
| Release | : |
| ISBN-10 | : |
| ISBN-13 | : |
| Rating | : 4/5 ( Downloads) |
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 and published by Infinite Study. This book was released on with total page 7 pages. 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).
Top