General Mathematics

    

A New Algorithm for Finding Minimum Spanning Trees with Undirected Neutrosophic Graphs

Authors: Arindam Dey, Said Broumi, Le Hoang Son, Assia Bakali, Mohamed Talea, Florentin Smarandache

In this paper, we discuss the minimum spanning tree (MST) problem of an undirected neutrosophic weighted connected graph in which a single-valued neutrosophic number, instead of a real number/fuzzy number, is assigned to each arc as its arc length.We define this type of MST as neutrosophic minimum spanning tree (NMST).

Comments: 7 Pages.

Download: PDF

Submission history

[v1] 2018-08-20 05:12:26

Unique-IP document downloads: 220 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