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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Neutrosophic sets and systems 2020-12, Vol.36, p.37
Hauptverfasser:	Ghods, Masoud, Rostami, Zahra
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!