New Concepts on Quadripartitioned Neutrosophic Competition Graph with Application

The quadripartitioned neutrosophic set is defined by dividing the indeterminacy function of the neutrosophic set into the contradiction and ignorance components. Quadripartitioned neutrosophic sets offer an additional means to represent imprecise, uncertain, inconsistent, and incomplete information encountered in real-world scenarios. This research paper introduces the concept of a quadripartitioned neutrosophic competition graph for the first time with its application to graphs. Furthermore, the paper establishes operations for quadripartitioned neutrosophic competition graphs, such as the Cartesian product and direct product. The proposed concepts are exemplified and applied to a quadripartitioned neutrosophic digraph in the context of travel time. Moreover the developed concepts are applied to an optimization techniques on quadripartitioned neutrosophic competition graph with sensitivity analysis, which studies the robustness to the proposed quadripartitioned neutrosophic competition framework.