This research demonstrates a method to find minimum spanning trees in neutrosophic graphs, indicating new insights into uncertain network modeling.
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.
No takes yet. Share an insight, caveat, or question.
J. Malarvizhi (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: