Spanning Tree Problem with Neutrosophic Edge Weights 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 Spanning Tree Problem with Neutrosophic Edge Weights PDF full book. Access full book title Spanning Tree Problem with Neutrosophic Edge Weights by Said Broumi. Download full books in PDF and EPUB format.
Author: Said Broumi
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 10
Get Book Here
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.
Author: Said Broumi
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 10
Get Book Here
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.
Author: Arindam Dey
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 7
Get Book Here
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: Said Broumi
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 11
Get Book Here
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: G. Upender Reddy
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 15
Get Book Here
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
Get Book Here
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: Avishek Chakraborty
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 18
Get Book Here
Book Description
In this current era, neutrosophic set theory is a crucial topic to demonstrate the ambiguous information due to existence of three disjunctive components appears in it and it provides a wide range of applications in distinct fields for the researchers. Generally, neutrosophic sets is the extended version of crisp set, fuzzy set and intuitionistic fuzzy sets to focus on the uncertain, hesitant and ambiguous datas of a real life mathematical problem.
Author: Masoud Ghods
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 13
Get Book Here
Book Description
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.
Author: Ling Xin
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 10
Get Book Here
Book Description
The computing with Words (CW) is a well known soft computing method to find the solutions of many decision making problems in real life scenarios which consists of selective information used in natural language.
Author: Liangsong Huang
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 20
Get Book Here
Book Description
Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results.
Author: Ranjan Kumar
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 16
Get Book Here
Book Description
Neutrosophic (NS) set hypothesis gives another way to deal with the vulnerabilities of the shortest path problems (SPP). Several researchers have worked on fuzzy shortest path problem (FSPP) in a fuzzy graph with vulnerability data and completely different applications in real world eventualities. However, the uncertainty related to the inconsistent information and indeterminate information isn't properly expressed by fuzzy set. The neutrosophic set deals these forms of uncertainty. This paper presents a model for shortest path problem with various arrangements of integer-valued trapezoidal neutrosophic (INVTpNS) and integer-valued triangular neutrosophic (INVTrNS). We characterized this issue as Neutrosophic Shortest way problem (NSSPP). The established linear programming (LP) model solves the classical SPP that consists of crisp parameters. To the simplest of our data, there's no multi objective applied mathematics approach in literature for finding the Neutrosophic shortest path problem (NSSPP).
