Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning
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 relate...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2020-09-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/ConnectivityIndexinneutrosophic4.pdf |