Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs
This research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems. We analyze the effectiveness of Prim's method for construct...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of New Mexico
2025-06-01
|
| Series: | Neutrosophic Sets and Systems |
| Subjects: | |
| Online Access: | https://fs.unm.edu/NSS/21MinimumSpanning.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849232878437662720 |
|---|---|
| author | Sukanta Ghadei Amaresh Chandra Panada Surapati Pramanik Nihar Ranjan Panda Prasanta Kumar Raut |
| author_facet | Sukanta Ghadei Amaresh Chandra Panada Surapati Pramanik Nihar Ranjan Panda Prasanta Kumar Raut |
| author_sort | Sukanta Ghadei |
| collection | DOAJ |
| description | This research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems. We analyze the effectiveness of Prim's method for constructing the minimum spanning trees in undirected neutrosophic networks, where edge weights are denoted by neutrosophic numbers. Neutrosophic numbers with components reflecting truth, uncertainty, and Neutrosophic Sets and Systems, Vol. 85, 2025 362 Sukanta Ghadei, Amaresh Chandra Panada,Surapati,Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut, Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs falsehood provide a more sophisticated method of expressing uncertainty in network modeling. Here, we use a score function to contrast different NMSTs based on weights calculated by adding neutrosophic numbers. This method is particularly beneficial for use in transportation, communication networks, and logistics, where uncertain properties frequently define network configurations. Numerical illustrations prove the effectiveness of the proposed method, showing its efficiency in handling neutrosophic graphs and keeping it computationally feasible. The results indicated that the suggested Prim's algorithm efficiently produces the minimum spanning trees in uncertain environments and is advantageous for network design and optimization in these scenarios. |
| format | Article |
| id | doaj-art-0c00ae01fec44deba0eebc5babf91fab |
| institution | Kabale University |
| issn | 2331-6055 2331-608X |
| language | English |
| publishDate | 2025-06-01 |
| publisher | University of New Mexico |
| record_format | Article |
| series | Neutrosophic Sets and Systems |
| spelling | doaj-art-0c00ae01fec44deba0eebc5babf91fab2025-08-20T16:35:51ZengUniversity of New MexicoNeutrosophic Sets and Systems2331-60552331-608X2025-06-018536137910.5281/zenodo.15272504Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic GraphsSukanta GhadeiAmaresh Chandra PanadaSurapati PramanikNihar Ranjan PandaPrasanta Kumar RautThis research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems. We analyze the effectiveness of Prim's method for constructing the minimum spanning trees in undirected neutrosophic networks, where edge weights are denoted by neutrosophic numbers. Neutrosophic numbers with components reflecting truth, uncertainty, and Neutrosophic Sets and Systems, Vol. 85, 2025 362 Sukanta Ghadei, Amaresh Chandra Panada,Surapati,Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut, Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs falsehood provide a more sophisticated method of expressing uncertainty in network modeling. Here, we use a score function to contrast different NMSTs based on weights calculated by adding neutrosophic numbers. This method is particularly beneficial for use in transportation, communication networks, and logistics, where uncertain properties frequently define network configurations. Numerical illustrations prove the effectiveness of the proposed method, showing its efficiency in handling neutrosophic graphs and keeping it computationally feasible. The results indicated that the suggested Prim's algorithm efficiently produces the minimum spanning trees in uncertain environments and is advantageous for network design and optimization in these scenarios.https://fs.unm.edu/NSS/21MinimumSpanning.pdfminimum spanning tree (mst)prim's algorithm |
| spellingShingle | Sukanta Ghadei Amaresh Chandra Panada Surapati Pramanik Nihar Ranjan Panda Prasanta Kumar Raut Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs Neutrosophic Sets and Systems minimum spanning tree (mst) prim's algorithm |
| title | Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs |
| title_full | Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs |
| title_fullStr | Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs |
| title_full_unstemmed | Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs |
| title_short | Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs |
| title_sort | evaluating the minimum spanning trees using prim s algorithm with undirected neutrosophic graphs |
| topic | minimum spanning tree (mst) prim's algorithm |
| url | https://fs.unm.edu/NSS/21MinimumSpanning.pdf |
| work_keys_str_mv | AT sukantaghadei evaluatingtheminimumspanningtreesusingprimsalgorithmwithundirectedneutrosophicgraphs AT amareshchandrapanada evaluatingtheminimumspanningtreesusingprimsalgorithmwithundirectedneutrosophicgraphs AT surapatipramanik evaluatingtheminimumspanningtreesusingprimsalgorithmwithundirectedneutrosophicgraphs AT niharranjanpanda evaluatingtheminimumspanningtreesusingprimsalgorithmwithundirectedneutrosophicgraphs AT prasantakumarraut evaluatingtheminimumspanningtreesusingprimsalgorithmwithundirectedneutrosophicgraphs |