In this chapter, we introduce a new algorithm for finding a minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph whose edge weight

In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic n

Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still

This book treats all kind of data in neutrosophic environment, with real-life applications, approaching topics as linear programming problem, linear fractional

Human psychological behavior is always uncertain in nature with the truth, indeterminacy and falsity of the information and hence neutrosophic logic is able to