SINGLE VALUED NEUTROSOPHIC TREES

SINGLE VALUED NEUTROSOPHIC TREES
Author: A. HASSAN
Publisher: Infinite Study
Total Pages: 12
Release:
Genre: Mathematics
ISBN:

The edge connectivity plays important role in computer network problems and path problems. In this paper, we introduce special types of single valued neutrosophic (SVN) bridges, single valued neutrosophic cut-vertices, single valued neutrosophic cycles and single valued neutrosophic trees in single valued neutrosophic graphs, and introduced some of their properties.

Achievable Single-Valued Neutrosophic Graphs in Wireless Sensor Networks

Achievable Single-Valued Neutrosophic Graphs in Wireless Sensor Networks
Author: M. Hamidi
Publisher: Infinite Study
Total Pages: 31
Release:
Genre:
ISBN:

This paper considers wireless sensor (hyper)networks by single–valued neutrosophic (hyper)graphs. It tries to extend the notion of single– valued neutrosophic graphs to single–valued neutrosophic hypergraphs and it is derived single–valued neutrosophic graphs from single–valued neutrosophic hypergraphs via positive equivalence relation.

Accessible single-valued neutrosophic graphs

Accessible single-valued neutrosophic graphs
Author: M. Hamidi
Publisher: Infinite Study
Total Pages: 26
Release:
Genre:
ISBN:

This paper derived single-valued neutrosophic graphs from single-valued neutrosophic hypergraphs via strong equivalence relation. We show that any weak single-valued neutrosophic graph is a derived single-valued neutrosophic graph and any linear weak single-valued neutrosophic tree is an extendable linear single-valued neutrosophic tree.

Single-Valued Neutrosophic Graphs

Single-Valued Neutrosophic Graphs
Author: Muhammad Akram
Publisher: Springer
Total Pages: 389
Release: 2018-12-30
Genre: Mathematics
ISBN: 9811335222

This book addresses single-valued neutrosophic graphs and their applications. In addition, it introduces readers to a number of central concepts, including certain types of single-valued neutrosophic graphs, energy of single-valued neutrosophic graphs, bipolar single-valued neutrosophic planar graphs, isomorphism of intuitionistic single-valued neutrosophic soft graphs, and single-valued neutrosophic soft rough graphs. Divided into eight chapters, the book seeks to remedy the lack of a mathematical approach to indeterminate and inconsistent information. Chap. 1 presents a concise review of single-valued neutrosophic sets, while Chap. 2 explains the notion of neutrosophic graph structures and explores selected properties of neutrosophic graph structures. Chap. 3 discusses specific bipolar neutrosophic graphs. Chap. 4 highlights the concept of interval-valued neutrosophic graphs, while Chap. 5 presents certain notions concerning interval-valued neutrosophic graph structures. Chap. 6 addresses the concepts of rough neutrosophic digraphs and neutrosophic rough digraphs. Chap. 7 focuses on the concepts of neutrosophic soft graphs and intuitionistic neutrosophic soft graphs, before Chap. 8 rounds out the book by considering neutrosophic soft rough graphs.

Neutrosophic Graph Theory and Algorithms

Neutrosophic Graph Theory and Algorithms
Author: Smarandache, Florentin
Publisher: IGI Global
Total Pages: 406
Release: 2019-10-25
Genre: Computers
ISBN: 1799813150

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.

Special types of bipolar single valued neutrosophic graphs

Special types of bipolar single valued neutrosophic graphs
Author: Ali Hassan
Publisher: Infinite Study
Total Pages: 19
Release: 2017-01-01
Genre: Mathematics
ISBN:

Neutrosophic theory has many applications in graph theory, bipolar single valued neutrosophic graphs (BSVNGs) is the generalization of fuzzy graphs and intuitionistic fuzzy graphs, SVNGs. In this paper we introduce some types of BSVNGs, such as subdivision BSVNGs, middle BSVNGs, total BSVNGs and bipolar single valued neutrosophic line graphs (BSVNLGs), also investigate the isomorphism, co weak isomorphism and weak isomorphism properties of subdivision BSVNGs, middle BSVNGs, total BSVNGs and BSVNLGs.

Novel applications of bipolar single-valued neutrosophic competition graphs

Novel applications of bipolar single-valued neutrosophic competition graphs
Author: Muhammad Akram
Publisher: Infinite Study
Total Pages: 32
Release:
Genre: Mathematics
ISBN:

Bipolar single-valued neutrosophic models are the generalization of bipolar fuzzy models. We rst introduce the concept of bipolar single-valued neutrosophic competition graphs. We then, discuss some important propositions related to bipolar single-valued neutrosophic competition graphs.

Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm

Double-Valued Neutrosophic Sets, their Minimum Spanning Trees, and Clustering Algorithm
Author: Ilanthenral Kandasamy
Publisher: Infinite Study
Total Pages: 20
Release:
Genre:
ISBN:

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.

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
Author: Masoud Ghods
Publisher: Infinite Study
Total Pages: 13
Release: 2020-10-01
Genre: Mathematics
ISBN:

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 Graphs: A New Dimension to Graph Theory

Neutrosophic Graphs: A New Dimension to Graph Theory
Author: Vasantha Kandasamy
Publisher: Infinite Study
Total Pages: 127
Release: 2015
Genre: Graph theory
ISBN: 1599733625

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.