Generalized Neutrosophic Competition Graphs

Abstract

The generalized neutrosophic graph is a generalization of the neutrosophic graph that represents a system perfectly. In this study, the concept of a neutrosophic digraph, generalized neutrosophic digraph and out-neighbourhood of a vertex of a generalized neutrosophic digraph is studied. The generalized neutrosophic competition graph and matrix representationareanalyzed. Also, the minimal graph and competition number corresponding to generalized neutrosophic competition graph are defined with some properties. At last, an application in real life is discussed.