Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs PDF full book. Access full book title Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs by G. Upender Reddy. Download full books in PDF and EPUB format.
Author: G. Upender Reddy Publisher: Infinite Study ISBN: Category : Mathematics Languages : en Pages : 15
Book Description
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.
Author: G. Upender Reddy Publisher: Infinite Study ISBN: Category : Mathematics Languages : en Pages : 15
Book Description
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.
Author: Said Broumi Publisher: Infinite Study ISBN: Category : Languages : en Pages : 5
Book Description
Interval valued bipolar neutrosophic sets is a new generalization of fuzzy set, bipolar fuzzy set, neutrosophic set and bipolar neutrosophic set so that it can handle uncertain information more flexibly in the process of decision making.
Author: Said Broumi Publisher: Infinite Study ISBN: Category : Languages : en Pages : 6
Book Description
The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG).
Author: Arindam Dey Publisher: Infinite Study ISBN: Category : Languages : en Pages : 7
Book Description
In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic number, instead of a real number/fuzzy number, is assigned to each arc as its arc length.We define this type of MST as neutrosophic minimum spanning tree (NMST).
Author: M. Mullai Publisher: Infinite Study ISBN: Category : Languages : en Pages : 9
Book Description
Normally, Minimal Spanning Tree algorithm is used to find the shortest route in a network. Neutrosophic set theory is used when incomplete, inconsistancy and indeterminacy occurs. In this paper, Bipolar Neutrosophic Numbers are used in Minimal Spanning Tree algorithm for finding the shortest path on a network when the distances are inconsistant and indeterminate and it is illustrated by a numerical example.
Author: Said Broumi Publisher: Infinite Study ISBN: Category : Languages : en Pages : 10
Book Description
Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finally a numerical example is provided
Author: Said Broumi Publisher: Infinite Study ISBN: Category : Languages : en Pages : 16
Book Description
In this chapter, we introduce a new algorithm for finding a minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph whose edge weights are represented by an interval valued neutrosophic number.
Author: Said Broumi Publisher: Infinite Study ISBN: Category : Languages : en Pages : 11
Book Description
In this paper, an algorithm for searching the minimum spanning tree (MST) in a network having trapezoidal fuzzy neutrosophic edge weight is presented.
Author: Ilanthenral Kandasamy Publisher: Infinite Study ISBN: Category : Languages : en Pages : 20
Book Description
Neutrosophy (neutrosophic logic) is used to represent uncertain, indeterminate, and inconsistent information available in the real world. This article proposes a method to provide more sensitivity and precision to indeterminacy, by classifying the indeterminate concept/value into two based on membership: one as indeterminacy leaning towards truth membership and the other as indeterminacy leaning towards false membership.
Author: Bang Ye Wu Publisher: CRC Press ISBN: 0203497287 Category : Computers Languages : en Pages : 200
Book Description
The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under
Author: G. Upender Reddy
Author: G. Upender Reddy
Author: Said Broumi
Author: Said Broumi
Author: Arindam Dey
Author: M. Mullai
Author: Said Broumi 
Author: Said Broumi
Author: Said Broumi
Author: Ilanthenral Kandasamy
Author: Bang Ye Wu