Minimum Spanning Tree Problem with Single-Valued Trapezoidal Neutrosophic Numbers

Said Broumi,Florentin Smarandache,Santanu Kumar Patro,Assia Bakali,Mohamed Talea

doi:10.1007/978-3-030-01177-2_7

Minimum Spanning Tree Problem with Single-Valued Trapezoidal Neutrosophic Numbers

Said Broumi, Florentin Smarandache + Show 3 more

https://doi.org/10.1007/978-3-030-01177-2_7

Copy DOI

Publication Date: Nov 2, 2018

Citations: 3

Affiliation: University of Hassan II Casablanca, Berhampur University, École Royale Navale

#Single-Valued Trapezoidal Neutrosophic Numbers #Minimum Spanning Tree + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

A single valued trapezoidal neutrosophic number (SVTNN) is a special case of single valued neutrosophic set (SVNS), which is defined on real number set. This paper investigates the single valued trapezoidal neutrosophic minimum spanning tree (SVTNMST) problem where the edge weights are assumed to be single valued trapezoidal neutrosophic variable. A neutrosophic Kruskal algorithm is presented for searching the minimum spanning tree in a single valued trapezoidal neutrosophic graph (SVTN-graph). To check the validity of the proposed algorithm, an illustrative example is explained. Finally, a comparison study has been made with Mullai’s algorithm in neutrosophic graphs.

Full Text