AboutSign inJoin
A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph

A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph

Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Kishore Kumar P K — 2026
In this chapter, we introduce a new algorithm for finding a minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph whose edge weights are represented by an interval valued neutrosophic number.
Sign up to use