THE NEUTROSOPHIC MINIMUM SPANNING TREE PROBLEM IN CONNECTED UNDIRECTED WEIGHTED COMPLETE STRONG NEUTROSOPHIC GRAPHS

N = (S, R) is a Single Valued Neutrosophic Graph (SVNG) andCSN = (S, R) is aComplete StrongNeutrosophic Graph (CSNG).A complete strongneutrosophic graph provides neutrosophic evaluation on both vertices and edges, making it ideal for modeling highly uncertain, complex and inconsistent environments. In this research study, determining theneutrosophic minimum spanning tree (NMST) is introduced in anconnected undirected weighted complete strong neutrosophic graph (CUWCSNG) using Kruskal's Algorithm. Illustrativeexample is given to explain the proposed algorithm.