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.
Spanning Tree Problem with Neutrosophic Edge Weights
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.
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.
A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
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).
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).
Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment
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.
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.
Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs
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.
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.
De-Neutrosophication Technique of Pentagonal Neutrosophic Number and Application in Minimal Spanning Tree
Author: Avishek Chakraborty
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 18
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.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 18
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.
Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree
Author: Masoud Ghods
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 13
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.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 13
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.
A Novel Approach Of Computing With Words By Using Neutrosophic Information
Author: Ling Xin
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 10
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.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 10
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.
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
Author: Liangsong Huang
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 20
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.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 20
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.
A Multi Objective Programming Approach to Solve Integer Valued Neutrosophic Shortest Path Problems
Author: Ranjan Kumar
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 16
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).
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 16
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).
Neutrosophic Sets and Systems, Vol. 29, 2019
Author: Florentin Smarandache
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 264
Book Description
“Neutrosophic Sets and Systems” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc.
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 264
Book Description
“Neutrosophic Sets and Systems” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc.