A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
Author :
Publisher : Infinite Study
Total Pages : 7
Release :
ISBN-10 :
ISBN-13 :
Rating : 4/5 ( Downloads)

Book Synopsis A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs by : Arindam Dey

Download or read book A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs written by Arindam Dey and published by Infinite Study. This book was released on with total page 7 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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).


A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs Related Books

A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
Language: en
Pages: 7
Authors: Arindam Dey
Categories:
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

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
Spanning Tree Problem with Neutrosophic Edge Weights
Language: en
Pages: 10
Authors: Said Broumi
Categories:
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which clas
A New Concept of Matrix Algorithm for MST in Undirected Interval Valued Neutrosophic Graph
Language: en
Pages: 16
Authors: Said Broumi
Categories:
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

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
Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs
Language: en
Pages: 15
Authors: G. Upender Reddy
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

DOWNLOAD EBOOK

The minimal spanning tree (MST) algorithms by using the edges weights were presented mainly by Prim’s and Kruskal’s algorithms. In this article we use the w
Neutrosophic Graph Theory and Algorithms
Language: en
Pages: 406
Authors: Smarandache, Florentin
Categories: Computers
Type: BOOK - Published: 2019-10-25 - Publisher: IGI Global

DOWNLOAD EBOOK

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