In this paper, we conduct a comprehensive study of Trees, Forests, and Paths within the
framework of Fuzzy and Neutrosophic Graphs. Graph theory, known for its wide-ranging …

Contemporary mathematical techniques have been crafted to address the uncertainty of
numerous real-world settings, including Fermatean neutrosophic fuzzy set theory …

Modern mathematics and applied sciences have shown significant interest in the study of
graphs. The reason for this is that graphs possess a broad spectrum of applications across …

In many scientific domains, there is a growing interest in the shortest path problem. Traffic
routes that can be precisely defined become arbitrary due to the damage that …

This study introduces and explores new concepts of Turiyam Neutrosophic Soft Graphs and
General Plithogenic Soft Graphs. It examines models of uncertain graphs, including Fuzzy …

The A* search algorithm is widely utilized to evaluate the shortest path in a given network.
However, in a traditional A* search algorithm, the nodes are assumed to have crisp values …

Dijkstra's algorithm (DA) is a very popular approach for finding the shortest route (SR) in the
shortest route problem (SRP). The SRP becomes a challenging and complex problem in …

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 …

This paper aims to define a special case of neutrosophic matrices referred to as Fermatean
neutrosophic matrices (FNMs). FNMs were introduced as generalization of Fermatean fuzzy …

Shortest path problems in graph theory are applicable in areas like emergency services,
mapping software, and computer networks. Fuzzy arc weights introduce uncertainty, typically …