A new algorithm for finding minimum spanning trees with undirected 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 A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs PDF full book. Access full book title A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs by Arindam Dey. Download full books in PDF and EPUB format.

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

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).

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

Author: Arindam Dey
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 7

Get Book Here

Spanning Tree Problem with Neutrosophic Edge Weights

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. 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

A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph

Author: Said Broumi
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 16

Get Book Here

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.

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

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.

Neutrosophic Graph Theory and Algorithms

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.

Bipolar Neutrosophic Minimum Spanning Tree

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).

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

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.

Neutrosophic Sets and Systems, vol. 48/2022

Author: Florentin Smarandache
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 496

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. Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. This theory considers every notion or idea together with its opposite or negation and with their spectrum of neutralities in between them (i.e. notions or ideas supporting neither nor ). The and ideas together are referred to as . Neutrosophy is a generalization of Hegel's dialectics (the last one is based on and only). According to this theory every idea tends to be neutralized and balanced by and ideas - as a state of equilibrium. In a classical way , , are disjoint two by two. But, since in many cases the borders between notions are vague, imprecise, Sorites, it is possible that , , (and of course) have common parts two by two, or even all three of them as well. Neutrosophic Set and Neutrosophic Logic are generalizations of the fuzzy set and respectively fuzzy logic (especially of intuitionistic fuzzy set and respectively intuitionistic fuzzy logic).

Computing Minimum Spanning Tree in Interval Valued Bipolar Neutrosophic Environment International

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.

Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment

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.