The Neutrosophic Minimum Spanning Tree Problem in Connected Undirected Weighted Complete Strong Neutrosophic Graphs
Year: 2025
Type: article
Abstract: 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.
Author: J. Malarvizhi
Institution: Government of Tamil Nadu
Language: English
Topic: Fuzzy and Soft Set Theory
Field: Decision Sciences
Domain: Social Sciences
Open Access status: diamond
OpenAlex ID: W4414928856
FWCI:
Cites:
Cited by:
Related to: