In this paper, we first define the concept of bipolar single neutrosophic graphs as the generalization of bipolar fuzzy graphs, N-graphs, intuitionistic fuzzy graph, single valued neutrosophic graphs and bipolar intuitionistic fuzzy graphs.

/pdf/an-introduction-to-bipolar-single-valued-neutrosophic-graph-4zzmawq940.pdf

An Introduction to Bipolar Single Valued Neutrosophic Graph Theory An Introduction to Bipolar Single Valued Neutrosophic Graph Theory

An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in
 nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.

/pdf/shortest-path-problem-using-bellman-algorithm-under-1n8k0ynvey.pdf

Shortest path problem using Bellman algorithm under neutrosophic environment

Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.

/pdf/the-shortest-path-problem-in-interval-valued-trapezoidal-and-5bbo82syg1.pdf

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

In the last decade, concealed by uncertain atmosphere, many algorithms have been studied deeply to workout the shortest path problem. In this paper, we compared the shortest path problem with various existing algorithms. Finally, we concluded the best algorithm for certain environment.

/pdf/shortest-path-problem-in-fuzzy-intuitionistic-fuzzy-and-51b6ua3yae.pdf

Shortest path problem in fuzzy, intuitionistic fuzzy and neutrosophic environment: an overview

In this paper, we point out a major issue of stock market regarding trending scenario of trades where data exactness, accuracy of expressing data and uncertainty of values (closing point of the day) are lacked We use neutrosophic soft sets (NSS) consisting of three factors (True, Uncertainty and False) to deal with exact state of data in several directions A new approach based on NSS is proposed for stock value prediction based on real data from last 7 years It calculates the stock price based on the factors like “open”, “high”, “low” and “adjacent close” The highest score value retrieved from the score function is used to determine which opening price and high price decide the closing price from the above mentioned four factors

Neutrosophic soft set decision making for stock trending analysis

A single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and intuitionistic fuzzy graphs. This paper addresses for the first time, the shortest path in an acyclic neutrosophic directed graph using ranking function. Here each edge length is assigned to single valued neutrosophic numbers instead of a real number. The neutrosophic number is able to represent the indeterminacy in the edge (arc) costs of neutrosophic graph. A proposed algorithm gives the shortest path and shortest path length from source node to destination node. Finally an illustrative example also included to demonstrate the proposed method in solving path problems with single valued neutrosophic arcs.

/pdf/shortest-path-problem-on-single-valued-neutrosophic-graphs-13nl18j1vg.pdf

Shortest path problem on single valued neutrosophic graphs

single valued neutrosophic graph is a generalized structure of fuzzy graph, intuitionistic fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs and intuitionistic fuzzy graphs.

Shortest Path Problem on Single Valued Neutrosophic Graphs

New concepts of coloring in vague graphs with application

Magic labeling on interval-valued intuitionistic fuzzy graphs

Theoretical concepts of graphs are highly utilized by computer science applications. Especially in research areas of computer science such as data mining, image segmentation,
clustering, image capturing and networking. In this paper, we introduce dm-regular, tdm-regular, m-highly irregular and m-highly totally irregular intuitionistic fuzzy graphs and some properties of them are discussed. Likewise, a comparative study between dm-regular (m-highly irregular) intuitionistic fuzzy graph and tdm-regular (m-highly totally irregular) intuitionistic fuzzy graph are given.

P.K. Kishore Kumar

Papers

Shortest path problem on single valued neutrosophic graphs

Shortest Path Problem on Single Valued Neutrosophic Graphs

New concepts of coloring in vague graphs with application

Magic labeling on interval-valued intuitionistic fuzzy graphs

A Study on Irregular Intuitionistic Fuzzy Graphs