Sign in
Join Literal
A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph
Florentin Smarandache
Want to read
Sign up to use
Florentin Smarandache
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
Want to read
Sign up to use
Want to read
Sign up to use
Overview
Reviews
Highlights
Editions
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.
Discover more books like A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph