ANewConceptOfMatrix.pdf (1.12 MB)
Download file

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

Download (1.12 MB)
journal contribution
posted on 05.09.2018, 07:20 by Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, Kishore Kumar PK
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. In addition, we compute the cost of MST and compare the de-neutrosophied value with an equivalent MST having the detereministic weights. Finally, a numerical example is provided.

History

Usage metrics

Licence

Exports