Pythagorean, Fermatean, and Complex Turiyam Neutrosophic Graphs

Abstract

Graph theory examines networks composed of nodes (vertices) and their connections (edges). A graph class is defined by shared structural properties governed by specific rules or constraints. This paper explores uncertain graph models, with a focus on Pythagorean, Fermatean, and Complex Turiyam Neutrosophic Graphs, which extend Neutrosophic Graphs to more effectively address uncertainty. Potential extensions using General Plithogenic Graphs are also discussed.