Audiobook
We may earn a commission. Learn more.
A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph
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.
No reviews yet.
Be the first to write one.
No highlights yet.
Be the first to share one.