Single Valued Pentapartitioned Neutrosophic Graphs

Background: The notion of single valued pentapartitioned neutrosophic set is the extension of single valued neutrosophic set and quadripartitioned single valued neutrosophic set. The single valued pentapartitioned neutrosophic set is a powerful mathematical tool that comprehensively deals with indeterminacy by splitting it into three independent components, namely, unknown, contradiction, ignorance. We apply the concept of single valued pentapartitioned neutrosophic set to graph theory. Findings: We develop the notions of Single-Valued Pentapartitioned Neutrosophic graph (SVPN-graph) as an extension of single valued neutrosophic graph theory. Besides, we introduce the notions of degree, size and order of an SVPN-graph. Further, we furnish a few suitable examples on SVPN-graph. Single valued pentapartitioned neutrosophic set. Limitations: Pentapartitioned neutrosophic graph is proposed in this model which is based on pentapartitioned neutrosophic sets. A few studies on pentapartitioned neutrosophic sets are reported in the literature. Future directions: In future, the single valued pentapartitioned neutrosophic graph can be extended to regular and irregular single valued pentapartitioned neutrosophic graph, single-valued pentapartitioned neutrosophic intersection graphs, single-valued pentapartitioned neutrosophic hypergraphs, and so on. The single-valued pentapartitioned neutrosophic graph can be employed in modeling the computer networks, expert systems, image processing, social network , and telecommunication