Journal article Open Access

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

Said Broumi; Assia Bakali; Mohamed Talea; Florentin Smarandache; Kishore Kumar P K

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.

Files (1.2 MB)
Name Size
ANewConceptOfMatrix.pdf
md5:af684fa39a80649925abbceda550ee4f
1.2 MB Download
4
6
views
downloads
All versions This version
Views 44
Downloads 66
Data volume 7.1 MB7.1 MB
Unique views 44
Unique downloads 55

Share

Cite as