Download Free Achievable Single Valued Neutrosophic Graphs In Wireless Sensor Networks Book in PDF and EPUB Free Download. You can read online Achievable Single Valued Neutrosophic Graphs In Wireless Sensor Networks and write the review.

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.
The concept of neutrosophic sets can be utilized as a mathematical tool to deal with imprecise and unspecified information. In this paper, we apply the concept of single-valued neutrosophic sets to graphs. We introduce the notion of single-valued neutrosophic graphs, and present some fundamental operations on single-valued neutrosophic graphs. We explore some interesting properties of single-valued neutrosophic graphs by level graphs. We highlight some flaws in the definitions of Broumi et al. [10] and Shah-Hussain [18]. We also present an application of single-valued neutrosophic graphs in social network.
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.
In this research paper, we present certain types of single-valued neutrosophic graphs, including edge regular single-valued neutrosophic graphs and totally edge regular single-valued neutrosophic graphs. We investigate some of their related properties. We describe an application of single-valued neutrosophic graph in decision making process and present the procedure of our method that is used in our application in an algorithm.
In this paper, we introduce the concepts of length, distance, eccentricity, radius, diameter, status, total status, median and central vertex of a single valued neutrosophic graph. We present the concept of self-centered single valued neutrosophic graph. We investigated some properties of self-centered single valued neutrosophic graphs.
This paper introduces the novel concept of KM-single valued neutrosophic metric spaces as an especial generalization of KM-fuzzy metric spaces, investigates several topological and structural properties and presents some of its applications. This study also considers the metric spaces and constructs KM-single valued neutrosophic spaces with respect to any given triangular norms and triangular conorms.
Many results have been obtained on isolated graphs and complete graphs. In this paper, a necessary and sufficient condition will be proved for a single valued neutrosophic graph to be an isolated single valued neutrosophic graph.
The notion of single valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic fuzzy sets. We apply the concept of single valued neutrosophic sets, an instance of neutrosophic sets, to graphs. We introduce certain types of single valued neutrosophic graphs (SVNG) and investigate some of their properties with proofs and examples.
In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.
This paper introduces the concept of single–valued neutrosophic EQ–subalgebras, single–valued neutrosophic EQ–prefilters and single–valued neutrosophic EQ–filters. We study some properties of single–valued neutrosophic EQ–prefilters and show how to construct single–valued neutrosophic EQ–filters. Finally, the relationship between single–valued neutrosophic EQ–filters and EQ–filters are studied.