Amvik eBook Solutions

The minimal spanning tree (MST) algorithms by using the edges weights were presented mainly by Prim’s and Kruskal’s algorithms. In this article we use the w

In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic n

The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connect

Normally, Minimal Spanning Tree algorithm is used to find the shortest route in a network. Neutrosophic set theory is used when incomplete, inconsistancy and i

Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which clas