A Compact Exploration of Turiyam Neutrosophic Competition Graphs

Abstract

Graph theory, a branch of mathematics, examines relationships between entities using vertices and edges. Within this field, Uncertain Graph Theory has emerged to model uncertainties in real world networks. A notable concept in this area is the competition graph, which captures interactions by connecting vertices that ”compete” for the same neighbor, represented by directed edges indicating common neighbors in a digraph. This brief paper introduces the concept of the Generalized Turiyam Neutrosophic Competition Graph and explores its relationships with other graph classes.