Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs
Download or Read eBook Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs PDF written by G. Upender Reddy and published by Infinite Study. This book was released on with total page 15 pages. Available in PDF, EPUB and Kindle.
| Author | : G. Upender Reddy |
| Publisher | : Infinite Study |
| Total Pages | : 15 |
| Release | : |
| ISBN-10 | : |
| ISBN-13 | : |
| Rating | : 4/5 ( Downloads) |
Book Synopsis Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs by : G. Upender Reddy
Book excerpt: 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 weights for the bipolar neutrosophic edges by using the score functions with the new model algorithms namely bipolar neutrosophic Prim’s algorithm and bipolar neutrosophic Kruskal’s algorithm. Further, we use the score functions to get the more appropriate results based on the algorithms.
