SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS 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 SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS PDF full book. Access full book title SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS by M. Mullai. Download full books in PDF and EPUB format.
Author: M. Mullai
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 9
Get Book Here
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: M. Mullai
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 9
Get Book Here
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: 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 : 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: 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: 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: Said Broumi
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 7
Get Book Here
Book Description
This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest path length using ranking function from source node to destination node. Here each arc length is assigned to interval valued neutrosophic number. Finally, a numerical example has been provided for illustrating the proposed approach.
Author: Florentin Smarandache
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 264
Get Book Here
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.
Author: Florentin Smarandache
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 454
Get Book Here
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. Some articles in this issue: Parameter Reduction of Neutrosophic Soft Sets and Their Applications, Geometric Programming (NGP) Problems Subject to (⋁,.) Operator; the Minimum Solution, Ngpr Homeomorphism in Neutrosophic Topological Spaces, Generalized Neutrosophic Separation Axioms in Neutrosophic Soft Topological Spaces.
Author: Smarandache, Florentin
Publisher: IGI Global
ISBN: 1799813150
Category : Computers
Languages : en
Pages : 406
Get Book Here
Book Description
Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory.
Author: Said Broumi
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 6
Get Book Here
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).
