Journal article Open Access

Bipolar Neutrosophic Minimum Spanning Tree

Said Broumi; Assia Bakali; Mohamed Talea; FLORENTIN SMARANDACHE; Kifayat Ullah

The aim of this article is to introduce a matrix algorithm for finding minimum spanning tree (MST) in the environment of undirected bipolar neutrosophic connected graphs (UBNCG).

Files (296.6 kB)
Name Size
BipolarNeutrosophicMinimum.pdf
md5:484dc6b64c434ece817fdbea6f8196f9
296.6 kB Download
5
6
views
downloads
All versions This version
Views 55
Downloads 66
Data volume 1.8 MB1.8 MB
Unique views 55
Unique downloads 55

Share

Cite as