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...

Full description

Saved in:
Bibliographic Details
Main Authors: Sukanta Ghadei, Amaresh Chandra Panada, Surapati Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut
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!