Abstract—Interval valued bipolar neutrosophic sets is a new generalization of fuzzy set, bipolar fuzzy set, neutrosophic set and bipolar neutrosophic set so that it can handle uncertain information more flexibly in the process of decision making. In this paper, an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (UNWCG) in which the edge weights is represented by a an interval valued bipolar neutrosophic number is presented. The proposed algorithm is based on matrix approach to design the MST of UNWCG. A numerical example is provided to show the effectiveness of the proposed algorithm. Lastly, a comparative study with other existing methods is proposed.
Index Terms—Score function, interval valued bipolar neutrosophic sets, Neutrosophic sets, Spanning tree problem.
Said Broumi is with the University Hassan II, B.P 7955, Sidi Othman, Casablanca, Morocco (e-mail: broumisaid78@gmail.com).
Assia Bakali is with Ecole Royale Navale, Morocco (e-mail: assiabakali@yahoo.fr).
Mohamed Talea is with the University Hassan II, B.P 7955, Sidi Othman, Casablanca, Morocco (e-mail: taleamohamed@yahoo.fr)
Florentin Smarandache is with the University of New Mexico, 705 Gurley Avenue, Gallup, NM 87301, USA (e-mail: fsmarandache@gmail.com)
Rajkumar Verma is with the Guru Govind Singh Indraprastha University, Delhi, India (e-mail: rkver83@gmail.com)
[PDF]
Cite: Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, and Rajkumar Verma, "Computing Minimum Spanning Tree in Interval Valued Bipolar Neutrosophic Environment," International Journal of Modeling and Optimization vol. 7, no. 5, pp. 300-304, 2017.
