Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree
Download or Read eBook Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree PDF written by Masoud Ghods and published by Infinite Study. This book was released on 2020-10-01 with total page 13 pages. Available in PDF, EPUB and Kindle.
| Author | : Masoud Ghods |
| Publisher | : Infinite Study |
| Total Pages | : 13 |
| Release | : 2020-10-01 |
| ISBN-10 | : |
| ISBN-13 | : |
| Rating | : 4/5 ( Downloads) |
Book Synopsis Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree by : Masoud Ghods
Book excerpt: In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then define a strong spanning Neutrosophic tree. In the following, we propose an algorithm for detecting the maximum spanning tree in Neutrosophic graphs. Next, we discuss the Connectivity index and related theorems for Neutrosophic trees.
