SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS

SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS
Author: M. Mullai
Publisher: Infinite Study
Total Pages: 9
Release:
Genre:
ISBN:
GET BOOK

Download SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS Book in PDF, Epub and Kindle

Normally, Minimal Spanning Tree algorithm is used to find the shortest route in a network. Neutrosophic set theory is used when incomplete, inconsistancy and indeterminacy occurs. In this paper, Bipolar Neutrosophic Numbers are used in Minimal Spanning Tree algorithm for finding the shortest path on a network when the distances are inconsistant and indeterminate and it is illustrated by a numerical example.


SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS
Language: en
Pages: 9

SHORTEST PATH PROBLEM BY MINIMAL SPANNING TREE ALGORITHM USING BIPOLAR NEUTROSOPHIC NUMBERS

Authors: M. Mullai
Categories:
Type: BOOK - Published: - Publisher: Infinite Study

GET EBOOK

Normally, Minimal Spanning Tree algorithm is used to find the shortest route in a network. Neutrosophic set theory is used when incomplete, inconsistancy and i
Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs
Language: en
Pages: 15

Minimal Spanning Tree Algorithms w. r. t. Bipolar Neutrosophic Graphs

Authors: G. Upender Reddy
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

GET 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
Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment
Language: en
Pages: 11

Minimum Spanning Tree in Trapezoidal Fuzzy Neutrosophic Environment

Authors: Said Broumi
Categories:
Type: BOOK - Published: - Publisher: Infinite Study

GET EBOOK

In this paper, an algorithm for searching the minimum spanning tree (MST) in a network having trapezoidal fuzzy neutrosophic edge weight is presented.
A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs
Language: en
Pages: 7

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

Authors: Arindam Dey
Categories:
Type: BOOK - Published: - Publisher: Infinite Study

GET 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
Shortest Path Problem Under Interval Valued Neutrosophic Setting
Language: en
Pages: 7

Shortest Path Problem Under Interval Valued Neutrosophic Setting

Authors: Said Broumi
Categories: Mathematics
Type: BOOK - Published: - Publisher: Infinite Study

GET EBOOK

This paper presents a study of neutrosophic shortest path with interval valued neutrosophic number on a network. A proposed algorithm also gives the shortest pa