Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree
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...
Gespeichert in:
| Veröffentlicht in: | Neutrosophic sets and systems 2020-12, Vol.36, p.37 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. Keywords: Neutrosophic trees; totally and partial Connectivity indices; maximum spanning tree; strong spanning tree; strong cycle; strong edge |
|---|---|
| ISSN: | 2331-6055 |
| DOI: | 10.5281/zenodo.4065371 |