Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning

Abstract

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
• maximum spanning tree
• strong spanning tree
• strong cycle
• strong edge