General Mathematics

    

Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment

Authors: Said Broumi, Assia Bakali, Mohamed Talea, Florentin Smarandache, Vakkas Uluçay

In this paper, an algorithm for searching the minimum spanning tree (MST) in a network having trapezoidal fuzzy neutrosophic edge weight is presented. The network is an undirected neutrosophic weighted connected graph (UNWCG). The proposed algorithm is based on matrix approach to design the MST of UNWCG. A numerical example is provided to check the validity of the proposed algorithm. Next, a comparison example is made with Mullai’s algorithm in neutrosophic graphs.

Comments: 11 Pages.

Download: PDF

Submission history

[v1] 2018-08-21 02:56:37

Unique-IP document downloads: 164 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus