Calculation of shortest path on Fermatean Neutrosophic Networks
The shortest path (SP) problem (SPP) has several applications in graph theory. It can be used to calculate the distance between the provided initial and final vertex in a network. In this paper, we employed the Fermatean neutrosophic number as the appropriate edge weight of the network to estimate t...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2023-09-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/ShortestPathNeutrosophic22.pdf |