Minimal Spanning Tree Algorithms W R T Bipolar Neutrosophic Graphs
Minimal Spanning Tree Algorithms W R T Bipolar Neutrosophic Graphs Book in PDF, ePub and Kindle version is available to download in english. Read online anytime anywhere directly from your device. Click on the download button below to get a free pdf file of Minimal Spanning Tree Algorithms W R T Bipolar Neutrosophic Graphs book. This book definitely worth reading, it is an incredibly well-written.
Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs by G. Upender Reddy,T. Siva Nageswara Rao,V. Venkateswara Rao,Y. Srinivasa Rao Pdf
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.
Computing Minimum Spanning Tree in Interval Valued Bipolar Neutrosophic Environment International by Said Broumi,Assia Bakali,Mohamed Talea,Florentin Smarandache,Rajkumar Verma Pdf
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.
A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs by Arindam Dey,Said Broumi,Le Hoang Son,Assia Bakali,Mohamed Talea,Florentin Smarandache Pdf
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).
Bipolar Neutrosophic Minimum Spanning Tree by Said Broumi,Assia Bakali,Mohamed Talea,Florentin Smarandache Pdf
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).
Author : M. Mullai, S. Broumi, A. Stephen Publisher : Infinite Study Page : 9 pages File Size : 47,9 Mb Release : 2024-07-03 Category : Electronic ISBN : 8210379456XXX
SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS by M. Mullai, S. Broumi, A. Stephen Pdf
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.
Spanning Tree Problem with Neutrosophic Edge Weights by Said Broumi , Assia Bakali,Mohamed Talea,Florentin Smarandache,Arindam Dey,Le Hoang Son Pdf
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 by Said Broumi,Assia Bakali,Mohamed Talea,Florentin Smarandache,Kishore Kumar P K Pdf
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.
Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm by Ilanthenral Kandasamy Pdf
Neutrosophy (neutrosophic logic) is used to represent uncertain, indeterminate, and inconsistent information available in the real world. This article proposes a method to provide more sensitivity and precision to indeterminacy, by classifying the indeterminate concept/value into two based on membership: one as indeterminacy leaning towards truth membership and the other as indeterminacy leaning towards false membership.
Spanning Trees and Optimization Problems by Bang Ye Wu,Kun-Mao Chao Pdf
The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction. While work in this field remains quite active, the time has come to collect under
Classification of trapezoidal bipolar neutrosophic number, de‑bipolarization technique and its execution in cloud service‑based MCGDM problem by Avishek Chakraborty,Sankar Prasad Mondal,Shariful Alam,Arindam Dey Pdf
Neutrosophic set can deal with the uncertainties related to the information of any decision making problem in real life scenarios, where fuzzy set may fail to handle those uncertainties properly. In this study, we present the perception of trapezoidal bipolar neutrosophic numbers and its classification in different frame. We introduce the idea of disjunctive structures of trapezoidal bipolar neutrosophic numbers namely type-1 trapezoidal bipolar neutrosophic number, type-2 trapezoidal bipolar neutrosophic numbers, and type-3 trapezoidal bipolar neutrosophic number based on the perception of dependency among membership functions in neutrosophic set. In any neutrosophic decision-making problem, the decision maker uses the comparison of neutrosophic numbers to choose among alternatives solutions. Here, we introduce a ranking method, i.e., Debipolarization scheme for trapezoidal bipolar neutrosophic number (TrBNN) using removal area technique. We also describe the utility of trapezoidal bipolar neutrosophic number and its appliance in a multi criteria group decision making problem (MCGDM) for distinct users in trapezoidal bipolar arena which is more ethical, precise and reliable in neutrosophic field.
Different Forms of Triangular Neutrosophic Numbers, De-Neutrosophication Techniques, and their Applications by Avishek Chakraborty,Sankar Prasad Mondal,Ali Ahmadian,Norazak Senu,Shariful Alam,Soheil Salahshour Pdf
In this paper, we introduce the concept of neutrosophic number from different viewpoints. We define different types of linear and non-linear generalized triangular neutrosophic numbers which are very important for uncertainty theory. We introduced the de-neutrosophication concept for neutrosophic number for triangular neutrosophic numbers. This concept helps us to convert a neutrosophic number into a crisp number. The concepts are followed by two application, namely in imprecise project evaluation review technique and route selection problem.
In this work we plan to revise the main techniques for enumeration algorithms and to show four examples of enumeration algorithms that can be applied to efficiently deal with some biological problems modelled by using biological networks: enumerating central and peripheral nodes of a network, enumerating stories, enumerating paths or cycles, and enumerating bubbles. Notice that the corresponding computational problems we define are of more general interest and our results hold in the case of arbitrary graphs. Enumerating all the most and less central vertices in a network according to their eccentricity is an example of an enumeration problem whose solutions are polynomial and can be listed in polynomial time, very often in linear or almost linear time in practice. Enumerating stories, i.e. all maximal directed acyclic subgraphs of a graph G whose sources and targets belong to a predefined subset of the vertices, is on the other hand an example of an enumeration problem with an exponential number of solutions, that can be solved by using a non trivial brute-force approach. Given a metabolic network, each individual story should explain how some interesting metabolites are derived from some others through a chain of reactions, by keeping all alternative pathways between sources and targets. Enumerating cycles or paths in an undirected graph, such as a protein-protein interaction undirected network, is an example of an enumeration problem in which all the solutions can be listed through an optimal algorithm, i.e. the time required to list all the solutions is dominated by the time to read the graph plus the time required to print all of them. By extending this result to directed graphs, it would be possible to deal more efficiently with feedback loops and signed paths analysis in signed or interaction directed graphs, such as gene regulatory networks. Finally, enumerating mouths or bubbles with a source s in a directed graph, that is enumerating all the two vertex-disjoint directed paths between the source s and all the possible targets, is an example of an enumeration problem in which all the solutions can be listed through a linear delay algorithm, meaning that the delay between any two consecutive solutions is linear, by turning the problem into a constrained cycle enumeration problem. Such patterns, in a de Bruijn graph representation of the reads obtained by sequencing, are related to polymorphisms in DNA- or RNA-seq data.
Some properties of Pentagonal Neutrosophic Numbers and its Applications in Transportation Problem Environment by Avishek Chakraborty,Said Broumi,Prem Kumar Singh Pdf
In this research article we actually deals with the conception of pentagonal Neutrosophic number from a different frame of reference. Recently, neutrosophic set theory and its extensive properties have given different dimensions for researchers. This paper focuses on pentagonal neutrosophic numbers and its distinct properties. At the same time, we defined the disjunctive cases of this number whenever the truthiness, falsity and hesitation portion are dependent and independent to each other. Some basic properties of pentagonal neutrosophic numbers with its logical score and accuracy function is introduced in this paper with its application in real life operation research problem which is more reliable than the other methods.
International Journal of Neutrosophic Science (IJNS) Volume 5, 2020 by Broumi Said,Florentin Smarandache Pdf
International Journal of Neutrosophic Science (IJNS) is a peer-review journal publishing high quality experimental and theoretical research in all areas of Neutrosophic and its Applications. IJNS is published quarterly. IJNS is devoted to the publication of peer-reviewed original research papers lying in the domain of neutrosophic sets and systems. Papers submitted for possible publication may concern with foundations, neutrosophic logic and mathematical structures in the neutrosophic setting. Besides providing emphasis on topics like artificial intelligence, pattern recognition, image processing, robotics, decision making, data analysis, data mining, applications of neutrosophic mathematical theories contributing to economics, finance, management, industries, electronics, and communications are promoted.