Antipodal Turiyam Neutrosophic Graphs

Main Article Content

Takaaki Fujita
Florentin Smarandache

Abstract

Graph theory, a mathematical field, investigates the relationships between entities through vertices and edges [29]. Within this discipline, Uncertain Graph Theory emerges to model uncertainties in realworld networks. This paper presents the concept of the Antipodal Turiyam Neutrosophic Graph. In an Antipodal Graph, two nodes are connected if their shortest path distance equals the graph's diameter, emphasizing connections between the farthest nodes. Turiyam Neutrosophic Graphs extend traditional graphs by introducing four membership values-truth, indeterminacy, falsity, and liberal state-assigned to each vertex and edge, enabling a more nuanced representation of complex relationships.

Downloads

Download data is not yet available.

Article Details

How to Cite
Fujita, T., & Smarandache, F. (2024). Antipodal Turiyam Neutrosophic Graphs. Neutrosophic Optimization and Intelligent Systems, 5, 1-13. https://doi.org/10.61356/j.nois.2025.5422
Section
Original Articles

How to Cite

Fujita, T., & Smarandache, F. (2024). Antipodal Turiyam Neutrosophic Graphs. Neutrosophic Optimization and Intelligent Systems, 5, 1-13. https://doi.org/10.61356/j.nois.2025.5422

Most read articles by the same author(s)

Similar Articles

You may also start an advanced similarity search for this article.