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

Authors

  • Masoud Ghods
  • Zahra Rostami

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.

Downloads

Download data is not yet available.

Downloads

Published

2020-10-08

How to Cite

Masoud Ghods, & Zahra Rostami. (2020). Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree. Neutrosophic Sets and Systems, 36, 37-49. https://fs.unm.edu/nss8/index.php/111/article/view/4029