Evaluation of Spanning Tree of a Network with Pentagonal Neutrosopic Fuzzy Number
Satyajit Sahu
Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India.
Siva Prasad Behera *
Department of Mathematics, C.V. Raman Global University, Bhubaneswar-752054, Odisha, India.
*Author to whom correspondence should be addressed.
Abstract
Classical fuzzy sets and models may not adequately capture complicated, ambiguous, and uncertain real-life problems. Neutrosophic logic and neutrosophic sets theory are well-known theories for handling these types of several problems. In this work, we present a novel method that uses single-valued pentagonal neutrosophic integers as edge lengths to evaluate the smallest spanning tree of an undirected connected neutrosophic weighted graph. A new matrix-based algorithm for constructing the minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph is proposed. The suggested algorithm is compared with existing approaches, and a numerical example is provided for illustration. Highlight the key contributions of this study, including the algorithm’s compatibility with MATLAB and its improved ability to manage uncertainty compared to traditional approaches.
Keywords: Minimal spanning tree, weighted neutrosophic graph, neutrosophic sets, spanning tree