Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs

Abstract

The minimal spanning tree (MST) algorithms by using the edges weights are elderly presented mainly by Primƒ??s and Kruskalƒ??s algorithms. In this article we use the weights for the bipolar neutrosophic edges by using the score functions we angry with the new model algorithms namely bipolar neutrosophic Primƒ??s algorithm and bipolar neutrosophic Kruskalƒ??s algorithm. Further, we use the score functions we get the satisfied results based on the algorithms.

Keywords

Kruskalƒ??s algorithm and bipolar neutrosophic weighted edges. Minimal spanning tree Primƒ??s algorithm

  • Research Identity (RIN)

  • License

    Attribution 2.0 Generic (CC BY 2.0)

  • Language & Pages

    English, Array-Array

  • Classification

    NA