Connectivity Index In Neutrosophic Trees And The Algorithm To Find Its Maximum Spanning Tree
Connectivity Index In Neutrosophic Trees And The Algorithm To Find Its Maximum Spanning Tree 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 Connectivity Index In Neutrosophic Trees And The Algorithm To Find Its Maximum Spanning Tree book. This book definitely worth reading, it is an incredibly well-written.
Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree by Masoud Ghods,Zahra Rostami Pdf
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.
Neutrosophic Sets and Systems, Vol. 36, 2020 by Florentin Smarandache,Mohamed Abdel-Basset Pdf
“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: n-Refined Neutrosophic Modules, A Neutrosophic Approach to Digital Images, A Novel Method for Neutrosophic Assignment Problem by using Interval-Valued Trapezoidal Neutrosophic Number.
Neutrosophic Sets and Systems. An International Journal in Information Science and Engineering, Vol. 36, 2020 by Florentin Smarandache,Mohamed Abdel-Basset,Said Broumi Pdf
Neutrosophic Sets and Systems (NSS) is an academic journal, published quarterly online and on paper, that has been created for publications of advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics etc. and their applications in any field.
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).
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
Author : M. Mullai, S. Broumi, A. Stephen Publisher : Infinite Study Page : 9 pages File Size : 45,7 Mb Release : 2024-07-01 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.
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.
Fuzzy Graph Theory by Sunil Mathew,John N. Mordeson,Davender S. Malik Pdf
This book provides a timely overview of fuzzy graph theory, laying the foundation for future applications in a broad range of areas. It introduces readers to fundamental theories, such as Craine’s work on fuzzy interval graphs, fuzzy analogs of Marczewski’s theorem, and the Gilmore and Hoffman characterization. It also introduces them to the Fulkerson and Gross characterization and Menger’s theorem, the applications of which will be discussed in a forthcoming book by the same authors. This book also discusses in detail important concepts such as connectivity, distance and saturation in fuzzy graphs. Thanks to the good balance between the basics of fuzzy graph theory and new findings obtained by the authors, the book offers an excellent reference guide for advanced undergraduate and graduate students in mathematics, engineering and computer science, and an inspiring read for all researchers interested in new developments in fuzzy logic and applied mathematics.
Graph Theory and Its Applications, Second Edition by Jonathan L. Gross,Jay Yellen Pdf
Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine. What else is new? New chapters on measurement and analytic graph theory Supplementary exercises in each chapter - ideal for reinforcing, reviewing, and testing. Solutions and hints, often illustrated with figures, to selected exercises - nearly 50 pages worth Reorganization and extensive revisions in more than half of the existing chapters for smoother flow of the exposition Foreshadowing - the first three chapters now preview a number of concepts, mostly via the exercises, to pique the interest of reader Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Neutrosophic Graphs: A New Dimension to Graph Theory by Vasantha Kandasamy, Ilanthenral K,Florentin Smarandache Pdf
Studies to neutrosophic graphs happens to be not only innovative and interesting, but gives a new dimension to graph theory. The classic coloring of edge problem happens to give various results. Neutrosophic tree will certainly find lots of applications in data mining when certain levels of indeterminacy is involved in the problem. Several open problems are suggested.
Basic Neutrosophic Algebraic Structures and Their Application to Fuzzy and Neutrosophic Models by W. B. Vasantha Kandasamy,Florentin Smarandache Pdf
For the involvement of uncertainty of varying degrees, when the total of the membership degree exceeds one or less than one, then the newer mathematical paradigm shift, Fuzzy Theory proves appropriate.For the past two or three decades, Fuzzy Theory has become the potent tool to study and analyze uncertainty involved in all problems. But, many real world problems also abound with the concept of indeterminacy.In this book, the new, powerful tool of neutrosophy that deals with indeterminacy is utilized. Innovative neutrosophic models are described.The theory of neutrosophic graphs is introduced and applied to fuzzy and neutrosophic models.Neutrosophic Logic and Neutrosophic Set (generalizations of Intuitionistic Fuzzy Logic and Intuitionistic Fuzzy Set respectively) became strong tools for applications.
Optimization of Financial Asset Neutrosophic Portfolios by Marcel-Ioan Boloș,Ioana-Alexandra Bradea, Camelia Delcea Pdf
The purpose of this paper was to model, with the help of neutrosophic fuzzy numbers, the optimal financial asset portfolios, offering additional information to those investing in the capital market. The optimal neutrosophic portfolios are those categories of portfolios consisting of two or more financial assets, modeled using neutrosophic triangular numbers, that allow for the determination of financial performance indicators, respectively the neutrosophic average, the neutrosophic risk, for each financial asset, and the neutrosophic covariance as well as the determination of the portfolio return, respectively of the portfolio risk.
A Textbook of Graph Theory by R. Balakrishnan,K. Ranganathan Pdf
In its second edition, expanded with new chapters on domination in graphs and on the spectral properties of graphs, this book offers a solid background in the basics of graph theory. Introduces such topics as Dirac's theorem on k-connected graphs and more.
This book provides an introduction to hypergraphs, its aim being to overcome the lack of recent manuscripts on this theory. In the literature hypergraphs have many other names such as set systems and families of sets. This work presents the theory of hypergraphs in its most original aspects, while also introducing and assessing the latest concepts on hypergraphs. The variety of topics, their originality and novelty are intended to help readers better understand the hypergraphs in all their diversity in order to perceive their value and power as mathematical tools. This book will be a great asset to upper-level undergraduate and graduate students in computer science and mathematics. It has been the subject of an annual Master's course for many years, making it also ideally suited to Master's students in computer science, mathematics, bioinformatics, engineering, chemistry, and many other fields. It will also benefit scientists, engineers and anyone else who wants to understand hypergraphs theory.