Connectivity index in neutrosophic trees and the algorithm to find its maximum spanning tree PDF Download

Author: Masoud Ghods
Publisher: Infinite Study
ISBN:
Category : Mathematics
Languages : en
Pages : 13

View

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.

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

View

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: n-Refined Neutrosophic Modules, A Neutrosophic Approach to Digital Images, A Novel Method for Neutrosophic Assignment Problem by using Interval-Valued Trapezoidal Neutrosophic Number.

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

View

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

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

View

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

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

View

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

Author: M. Mullai
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 9

View

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: Ilanthenral Kandasamy
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 20

View

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

Author: Kanika Mandal
Publisher: Infinite Study
ISBN:
Category :
Languages : en
Pages : 10

View

Book Description
Minimum spanning tree finds its huge application in network designing, approximation algorithms for NP-hard problems, clustering problems and many more.

Author: Bang Ye Wu
Publisher: CRC Press
ISBN: 1135437033
Category : Mathematics
Languages : en
Pages : 187

View

Book Description
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 one cover spanning tree properties, classical results, and recent research developments. Spanning Trees and Optimization Problems offers the first complete treatment of spanning tree algorithms, from their role in classical computer science to their most modern applications. The authors first explain the general properties of spanning trees, then focus on three main categories: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees. Along with the theoretical descriptions of the methods, numerous examples and applications illustrate the concepts in practice. The final chapter explores several other interesting spanning trees, including maximum leaf spanning trees, minimum diameter spanning trees, Steiner trees, and evolutionary trees. With logical organization, well chosen topics, and easy to understand pseudocode, the authors provide not only a full, rigorous treatment of theory and applications, but also an excellent handbook for spanning tree algorithms. This book will be a welcome addition to your reference shelf whether your interests lie in graph and approximation algorithms for theoretical work or you use graph techniques to solve practical problems

Author: Sunil Mathew
Publisher: Springer
ISBN: 3319714074
Category : Technology & Engineering
Languages : en
Pages : 320

View

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