Inverse Neutrosophic Planar Graphs and its application in optimizing the expenditure in inter-cropping

Though Neutrosophic graphs have high impact on dealing with problems of indeterminacy, it may not directly address all aspects of edge membership degree constraints such as the truth membership degree of all edge is greater than or equal to the minimum of the membership degrees of its nodes is a specific structural constraint that may not be the case with the general framework of Neutrosophic graphs. This paper introduces a novel concept in the realm of Neutrosophic graphs defining a new graph variation called “Inverse Neutrosophic Graph”. This idea has the opportunity to enhance the field of Neutrosophic graph and provide new perspective into handling ambiguity in complex systems. Additionally, the basic properties and algebraic operations are studied in Inverse Neutrosophic graph. Moreover, we define Inverse Neutrosophic multi-graph and planarity in this paper. The related theories that establish a Neutrosophic Multi-graph’s strong (weak) planarity and score functions are then introduced. In our final section, we demonstrate how planarity in Inverse Neutrosophic Multi-graphs can be used to make decisions about how to minimize the expense of managing crops in inter cropping.