Generalized neutrosophic planar graphs and its application

In the existing definition of a neutrosophic planar graph, there is a limitation. In that definition, the value of falsity in degree of planarity is 1, even then the crisp underline graph is planar. This limitation is removed in the proposed definition. In this study, an advanced concept of the neutrosophic planar graphs is given and investigated the generalized neutrosophic planar graphs (GNPG). The score of planarity is calculated based on the true, falsity and indeterminacy values of degree of planarity to measure the overall planarity of a GNPG. And a few related properties are investigated. A real-life application is presented and solved by this concept of a GNPG.

Automated summary

In this study, an advanced concept of the neutrosophic planar graphs is given and investigated the generalized neutrosophic planar graphs (GNPG). The score of planarity is calculated based on the true, falsity and indeterminacy values of degree of planarity to measure the overall planarity of a GNPG. A real-life application is presented and solved by this concept of a GNPG.