Fuzzy set theory was introduced by Zadeh [17] to solve diculties in dealing with uncertainties. Since then the theory of fuzzy sets and fuzzy logic have been examined by many researchers to solve many real life problems, involving ambiguous and uncertain environment. Atanassov [3] introduced the concept of intuitionistic fuzzy set as an extension of Zadeh's fuzzy set [17]. An intuitionistic fuzzy set can be viewed as an alternative approach when available information is not sucient to de ne the impreciseness by the conventional fuzzy set.

In this paper, we define the regular and the totally regular interval valued neutrosophic hypergraphs, and discuss the order and size along with properties of the regular and the totally regular single valued neutrosophic hypergraphs. We extend work to completeness of interval valued neutrosophic hypergraphs.

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.

In this paper, we introduce the homomorphism, the weak isomorphism, the co-weak isomorphism, and the isomorphism of the bipolar single valued neutrosophic hypergraphs. The properties of order, size and degree of vertices are discussed. The equivalence relation of the isomorphism of the bipolar single valued neutrosophic hypergraphs and the weak isomorphism of bipolar single valued neutrosophic hypergraphs, together with their partial order relation, is also verified.

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.

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