Achievable Single-Valued Neutrosophic Graphs in Wireless Sensor Networks.

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. We use single-valued neutrosophic hypergraphs and positive equivalence relation to create the sensor clusters and access to cluster heads. Finally, the concept of (extended) derivable single-valued neutrosophic graph is considered as the energy clustering of wireless sensor networks and is applied this concept as a tool in wireless sensor (hyper) networks. [ABSTRACT FROM AUTHOR]