Share

Spanning Tree Problem with Neutrosophic Edge Weights

Download Spanning Tree Problem with Neutrosophic Edge Weights PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Spanning Tree Problem with Neutrosophic Edge Weights by : Said Broumi

Download or read book Spanning Tree Problem with Neutrosophic Edge Weights written by Said Broumi. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: 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.

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs

Download A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs by : Arindam Dey

Download or read book A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs written by Arindam Dey. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: 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).

Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment

Download Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment PDF Online Free

Author :
Release :
Genre :
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment by : Said Broumi

Download or read book Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment written by Said Broumi. This book was released on . Available in PDF, EPUB and Kindle. Book excerpt: In this paper, an algorithm for searching the minimum spanning tree (MST) in a network having trapezoidal fuzzy neutrosophic edge weight is presented.

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

Mathematics
Download Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs PDF Online Free

Author :
Release :
Genre : Mathematics
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs by : G. Upender Reddy

Download or read book Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs written by G. Upender Reddy. This book was released on . Available in PDF, EPUB and Kindle. 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.

Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree

2020-10-01 Mathematics
Download Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree PDF Online Free

Author :
Release : 2020-10-01
Genre : Mathematics
Kind : eBook
Book Rating : /5 ( reviews)

GET EBOOK


Book Synopsis Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree by : Masoud Ghods

Download or read book Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree written by Masoud Ghods. This book was released on 2020-10-01. Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we first define the Neutrosophic tree using the concept of the strong cycle. We then define a strong spanning Neutrosophic tree. In the following, we propose an algorithm for detecting the maximum spanning tree in Neutrosophic graphs. Next, we discuss the Connectivity index and related theorems for Neutrosophic trees.

You may also like...