0 Up votes0 Down votes

3 views5 pagesThe selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

May 29, 2017

© © All Rights Reserved

PDF, TXT or read online from Scribd

The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

© All Rights Reserved

3 views

The selection of shortest path problem is one the classic problems in graph theory. In literature, many algorithms have been developed to provide a solution for shortest path problem in a network. One of common algorithms in solving shortest path problem is Dijkstra’s algorithm. In this paper, Dijkstra’s algorithm has been redesigned to handle the case in which most of parameters of a network are uncertain and given in terms of neutrosophic numbers. Finally, a numerical example is given to explain the proposed algorithm.

© All Rights Reserved

- Discrete Math Introduction
- Discrete Structures Syllabus 2018 Anave
- Implementation of Dijkstra’s Shortest Path Algorithm in C++ _ Programming Techniques.pdf
- yuan2009.pdf
- Aldrian Text Searching
- Antiderivatives cal se cso rico
- 12 Graphs ShortestPath
- shortest Path Problems
- Programs
- Daa mcqs
- Optimization Multicast Routing Problem by Enabled Virtualization Rendezvous Point
- Vijay Daa Record Finel
- UCS 732 ppt on graphs MSTs and Shortest paths Dijkstra Bellman ford.pdf
- Final All-pairs Shortest Paths
- honeycomb.pdf
- History Match Case Study_Use of Assisted History Match Tools on Single Well Models in Conjunction With a Full - Field History Match_sahni2010
- Solution 1
- L29_Dynamic Programming (continued).ppt
- ADA_Lab
- Operations Research Model.ppt

You are on page 1of 5

Neutrosophic Shortest Path Problem

Said Broumi Assia Bakali

Laboratory of Information processing, Faculty of Science Ecole Royale Navale, Boulevard Sour Jdid, B.P 16303

Ben MSik, University Hassan II, B.P 7955, Sidi Othman, Casablanca, Morocco.

Casablanca, Morocco assiabakali@yahoo.fr

broumisaid78@gmail.com

Laboratory of Information processing, Faculty of Science Department of Mathematics, University of New

Ben MSik, University Hassan II, B.P 7955, Sidi Othman, Mexico,705 Gurley Avenue, Gallup, NM 87301, USA

Casablanca, Morocco fsmarandache@gmail.com; smarand@unm.edu

taleamohamed@yahoo.fr

Luige Vladareanu

Institute of Solid Mechanics, Romanian Academy, Bucharest, Romania.

luigiv2007@yahoo.com.sg, luigiv@imsar.bu.edu.ro

Abstract The selection of shortest path problem is one the environment based on single valued trapezoidal neutrosophic

classic problems in graph theory. In literature, many algorithms numbers and also provided the solution method. The operations

have been developed to provide a solution for shortest path on neutrosophic sets and the ranking methods are presented in

problem in a network. One of common algorithms in solving [10]

shortest path problem is Dijkstras algorithm. In this paper,

The shortest path problem (SPP) is one of the most

Dijkstras algorithm has been redesigned to handle the case in

which most of parameters of a network are uncertain and given fundamental and well-known combinatorial problems that

in terms of neutrosophic numbers. Finally, a numerical example appear in various fields of science and engineering, e.g, road

is given to explain the proposed algorithm. networks application, transportation and other applications. In

a network, the shortest path problem aims at finding the path

Keywords Dijkstras algorithm; Single valued neutrosophic from one source node to destination node with minimum

number; Shortest path problem; Network. weight, where some weight is attached to each edge

connecting a pair of nodes. The edge length of the network

I. INTRODUCTION may represent the real life quantities such as, time, cost, etc. In

To express indeterminate and inconsistent information which conventional shortest path problem, it is assumed that decision

exist in real world, Smarandache [1] originally proposed the maker is certain about the parameters (distance, time etc)

concept of a neutrosophic set from a philosophical point of between different nodes. But in real life situations, there

view. The concept of the neutrosophic set (NS for short) is always exist uncertainty about the parameters between

powerful mathematical tool which generalizes the concept of different nodes. For this purpose, many algorithms have been

classical sets, fuzzy sets [3], intuitionistic fuzzy sets [4], developed to find the shortest path under different types of

interval-valued fuzzy sets [5] and interval-valued intuitionistic input data, including fuzzy set, intuitionistic fuzzy sets, vague

fuzzy sets [6]. The concept of the neutrosophic has three basic sets [11-15]. One of the most used methods to solve the

components such that a truth-membership (T), indeterminacy- shortest path problem is the Dijkstras algorithm [16].

membership (I) and a falsity membership (F), which are Dijkstras algorithm solves the problem of finding the shortest

defined independently of one another. But a neutrosophic set path from a point in a graph (the source) to a destination.

So will be more difficult to apply it in real scientific and Recently, numerous papers have been published on

engineering areas. Thus , Wang et al. [7] proposed the concept neutrosophic graph theory [17-23]. In addition, Broumi et al.

of single valued neutrosophic set (for short SVNS), which is [24-26] proposed some algorithms to find the shortest path of

an instance of a neutrosophic set, whose functions of truth, a network (graph) where edge weights are characterized by a

indeterminacy and falsity lie in [0, 1] and provided the set neutrosophic numbers including single valued neutrosophic

theoretic operators and various properties of SVNSs. Some of numbers, bipolar neutrosophic numbers and interval valued

the recent research works on neutrosophic set theory and its neutrosophic numbers.

applications in various fields can be found in [8]. In addition, The main purpose of this paper is to propose a new version of

Thamaraiselvi and Santhi [9] introduced a mathematical Dijkstra algorithm for solving shortest path problem on a

representation of a transportation problems in neutrosophic network where the edge weights are characterized by a single

valued neutrosophic numbers. The proposed method is more

efficient due to the fact that the summing operation and the Definition 2.4 [10]. 0n may be defined as follow:

ranking of SVNNs can be done in a easy and straight manner. 0n { x, (0,1,1) : x X} (7)

The rest of the article is organized as follows. Section 2

introduces some basic concepts of neutrosophic sets, single A convenient method for comparing of single valued

valued neutrosophic sets. In Section 3, a network terminology neutrosophic number is by use of score function.

is presented, In section 4, we propose the new version of Definition 2.5 [11]. Let A1 (T1 , I1 , F1 ) be a single valued

Dijkstraalgorithm for solving the shortest path with neutrosophic number. Then, the score function s ( A ) , 1

connected edges in neutrosophic data. Section 5 illustrates a

practical example which is solved by the proposed algorithm. accuracy function a ( A1 ) and certainty function c( A1 ) of a

Conclusions and further research are given in section 6. SVNN are defined as follows:

2 T1 I1 F1

(i) s ( A1 ) (8)

3

II. PRELIMINARIES

(ii) a ( A1 ) T1 F1 (9)

In this section, some basic concepts and definitions on

neutrosophic sets and single valued neutrosophic sets are

(iii) c( A ) T (10)

1 1

reviewed from the literature.

Definition 2.6 [11]. Suppose that A1 (T1 , I1 , F1 )

Definition 2.1 [1]. Let X be a space of points (objects) with

and A (T , I , F ) are two single valued neutrosophic

generic elements in X denoted by x; then the neutrosophic set 2 2 2 2

numbers. Then, we define a ranking method as follows:

A (NS A) is an object having the form A = {< x: TA ( x ) ,

i. If s ( A1 ) s ( A 2 ) , then A1 is greater than A2 , that is,

I A ( x) , FA ( x) >, x X}, where the functions T, I, F:

A is superior to A , denoted by A A

1 2 1 2

X]0,1+[define respectively the truth-membership function,

an indeterminacy-membership function, and a falsity- ii. If s ( A1 ) s ( A 2 ) ,and a ( A1 ) a ( A 2 ) then A1 is

membership function of the element x X to the set A with greater than A2 , that is, A1 is superior to A2 , denoted

the condition:

by A A

1 2

0 TA ( x) + I A ( x) + FA ( x) 3 . +

(1) iii. If s ( A1 ) s ( A 2 ) , a ( A1 ) a ( A 2 ) , and c( A1 ) c ( A 2 )

then A is greater than A , that is, A is superior

1 2 1

The functions TA ( x) , I A ( x) and FA ( x) are real standard or to A2 , denoted by A1 A 2

nonstandard subsets of ]0,1+[. iv. If s ( A1 ) s ( A 2 ) , a ( A1 ) a ( A 2 ) , and c( A1 ) c ( A 2 )

Since it is difficult to apply NSs to practical problems, Wang

et al. [7] introduced the concept of a SVNS, which is an then A is equal to A , that is, A is indifferent to A ,

1 2 1 2

instance of a NS and can be used in real scientific and denoted by A1 A 2

engineering applications.

Definition 2.2 [7]. Let X be a space of points (objects) with III. NETWORK TERMINOLOGY

generic elements in X denoted by x. A single valued

neutrosophic set A (SVNS A) is characterized by truth- Consider a directed network G = (V, E) consisting of a finite

membership function TA ( x) , an indeterminacy-membership set of nodes V= {1, 2,,n} and a set of m directed edges

E V x V. Each edge is denoted by an ordered pair (i, j)

function I A ( x) , and a falsity-membership function FA ( x) .

where i, j V and i j . In this network, we specify two

For each point x in X TA ( x) , I A ( x) , FA ( x) [0, 1]. A nodes, denoted by s and t, which are the source node and the

SVNS A can be written as destination node, respectively. We define a path as a sequence

A = {< x: TA ( x) , I A ( x) , FA ( x) >, x X} (2) Pij ={i= i1 , (i1 , i2 ) , i2 ,, il 1 , (il 1 , il ) , il = j} of alternating

Definition 2.3 [10]. Let A1 (T1 , I1 , F1 ) and A2 (T2 , I 2 , F2 ) nodes and edges. The existence of at least one path Psi in G

be two single valued neutrosophic number. Then, the (V, E) is assumed for every i V-{s}.

operations for SVNNs are defined as below; dij Denotes a single valued neutrosophic number associated

i. A1 A2 T1 T2 T1T2 , I1I2 , F1F2 (3) with the edge (i ,j), corresponding to the length necessary to

ii. A1 A 2 T1T2 ,I1 I2 I1I2 , F1 F2 F1F2 ) (4) traverse (i, j) from i to j. In real problems, the lengths

correspond to the cost, the time, the distance, etc. Then

iii. A1 1 (1 T1 ) ), I1 , F1 ) (5) neutrosophic distance along the path P is denoted as d(P) is

iv. A (T ,1 (1 I ) ,1 (1 F ) ) where 0 (6) defined as

1 1 1 1

413

d(P)= d

(i, jP)

ij (14) After describing the proposed algorithm, in next section we

solve a numerical example and explain the proposed method

Remark: A node i is said to be predecessor node of node j if completely.

(i) Node i is directly connected to node j. V. ILLUSTRATIVE EXAMPLE

(ii) The direction of path connecting node i and j from i to j.

Now we solve an hypothetical example to verify the proposed

IV. SINGLE VALUED NEUTROSOPHIC DIJIKSTRA ALGORITHM approach. Consider the network shown in figure1; we want to

In this subsection, we slightly modified the fuzzy Dijkstra obtain the shortest path from node 1 to node 6 where edges

algorithm adapted from [27] in order to deal on a network have a single valued neutrosophic numbers. Let us now apply

the extended Dijkstra algorithm to the network given in figure

with parameters characterized by a single valued neutrosophic

numbers. 1.

4

This algorithm finds the shortest path and the shortest distance (0.2,0.3, 0.4) 3 (0.5,0.3, 0.1)

between a source node and any other node in the network. The (0.3,0.2, 0.6)

algorithm advances from a node i to an immediately

1

2

successive node j using a neutrosophic labeling procedure. Let (0.1,0.4, 0.6) (0.3,0.4, 0.7)

6

ui be the shortest distance from node 1 to node i and (0.4,0.6, 0.7)

ij 5

(0.6,0.5, 0.3)

2

[ u j , i] =[ ui dij , i]. S (dij ) 0 . (15)

Here label [ u j , i] mean we are coming from nodes i after Fig. 1. A network with single valued neutrosophic weights

covering a distance u j from the starting node. Dijkstras In this network each edge have been assigned to single valued

algorithm divides the nodes into two subset groups: neutrosophic number as follows:

Temporary set (T) and Permanent set (P). A temporary

neutrosophic label can be replaced with another temporary Edges Single valued Neutrosophic

neutrosophic label, if shortest path to the same neutrosophic distance

node is detected. At the point when no better path can be 1-2 (0.4, 0.6, 0.7)

found, the status of temporary label is changed to permanent. 1-3 (0.2, 0.3, 0.4)

The steps of the algorithm are summarized as follows: 2-3 (0.1, 0.4, 0.6)

Step 1 Assign to source node (say node 1) the permanent label 2-5 (0.7, 0.6, 0.8)

[ (0,1,1) ,-]. Set i=1. 3-4 (0.5, 0.3, 0.1)

Making a node permanent means that it has been included in 3-5 (0.3, 0.4, 0.7)

the short path. 4-6 (0.3, 0.2, 0.6)

Step 2 Compute the temporary label [ ui dij , i] for each node 5-6 (0.6, 0.5, 0.3)

j that can be reached from i, provided j is not permanently Table 1. weights of the graphs

labeled. If node j is already labeled as [ u j , k] through another

node k, and if S( ui dij ) < S( u j ) replace [ u j , k] with According to Dijikstras algorithm we start with

Iteration 0: Assign the permanent label [ (0,1,1) ,-] to node 1.

[ ui dij , i]. Iteration 1: Node 2 and node 3can be reached from (the last

Step 3 If all the nodes are permanently labeled, the algorithm permanently labeled) node 1. Thus, the list of labeled nodes

terminates. Otherwise, choose the label [ ur , s] with shortest (temporary and permanent) becomes

distance ( ur ) from the list of temporary labels. Set i= r and Nodes Status

label

repeat step 2. 1 [ (0,1,1) , -] P

Step 4 Obtain the shortest path between node 1 and the

destination node j by tracing backward through the network 2 [(0.4, 0.6, 0.7), 1] T

using the labels information. 3 [(0.2, 0.3, 0.4), 1] T

Remark:

At each iteration among all temporary nodes, make those In order to compare the (0.4, 0.6, 0.7) and (0.2, 0.3, 0.4) we

nodes permanent which have smallest distance. Note that at use the Eq.8

any iteration we can not move to permanent node, however, 2 T I F 2 0.2 0.3 0.4

S (0.2, 0.3, 0.4) = = =0.5

reverse is possible. After all the nodes have permanent labels 3 3

and only one temporary node remains, make it permanent.

414

2 T I F 2 0.4 0.6 0.7 5 [(0.82, 0.36, 0.56), 2] P

S (0.4, 0.6, 0.7) = = =0.36 6 [(0.93, 0.18, 0.17), 5] T

3 3

Since the rank of [(0.4, 0.6, 0.7), 1] is less than [(0.2, 0.3,

0.4), 1]. Thus the status of node 2 is changed to permanent.

Iteration 2: Node 3 and 5 can be reached from node 2. Thus, Since, there exit one permanent node from where we can

the list of labeled nodes ( temporary and permanent) becomes reach at node 6. So, make temporary label [(0.93, 0.18, 0.17),

5] as permanent.

Iteration 5: the only temporary node is 4, this node can be

Nodes label Status reached from node 3 and 6. Thus , the list of labeled nodes (

1 P temporary and permanent) becomes

[ (0,1,1) , -]

2 [(0.4, 0.6, 0.7), 1] P Nodes label Status

3 [(0.2, 0.3, 0.4), 1] or T 1 [ (0,1,1) , -] P

[(0.46, 0.24, 0.42), 2]

5 [(0.82, 0.36, 0.56), 2] T 2 [(0.4, 0.6, 0.7), 1] P

3 [(0.2, 0.3, 0.4), 1] P

4 [(0.6, 0.09, 0.04), 3] or T

2 0.46 0.24 0.42 [(0.95, 0.04, 0.10),6]

S (0.46, 0.24, 0.42) = =0.6 5 [(0.82, 0.36, 0.56), 2] P

3

6 [(0.93, 0.18, 0.17), 5] P

2 0.82 0.36 0.56

S (0.82, 0.36, 0.56) = =0.63

3

Among the temporary labels [(0.2, 0.3, 0.4), 1] or In order to compare the (0.6, 0.09, 0.04) and (0.95, 0.04,

[(0.46, 0.24, 0.42), 2], [(0.82, 0.36, 0.56), 2] and since the rank 0.10) we use the Eq.8

of (0.2, 0.3, 0.4) is less than of (0.46, 0.24, 0.42) and (0.82, S(0.6, 0.09, 0.04) =0.82 and S(0.95, 0.04, 0.10) = 0.94

0.36, 0.56), So the status of node 3 is changed to permanent. Since the rank of [(0.6, 0.09, 0.04), 3] is less than [(0.95,

0.04, 0.10),6]. And the node 4 is the only one temporary node

Iteration 3: Node 4and 5 can be reached from node 3. Thus , remains then, the status of node 4 is changed to permanent.

the list of labeled nodes ( temporary and permanent) becomes

Nodes label Status

Nodes label Status 1 [ (0,1,1) , -] P

1 [ (0,1,1) , -] P

2 [(0.4, 0.6, 0.7), 1] P

2 [(0.4, 0.6, 0.7), 1] P 3 [(0.2, 0.3, 0.4), 1] P

3 [(0.2, 0.3, 0.4), 1] P 4 [(0.6, 0.09, 0.04), 3] P

4 [(0.6, 0.09, 0.04), 3] T 5 [(0.82, 0.36, 0.56), 2] P

5 [(0.82, 0.36, 0.56), 2] T

or 6 [(0.93, 0.18, 0.17), 5] P

[(0.44, 0.12, 0.28), 3]

Based on the step 4, the following sequence determines the

2 0.6 0.09 0.04

shortest path from node 1 to node 6

S (0.6, 0.09, 0.04) = =0.82 (6) [(0.93, 0.18, 0.17), 5] (5) [(0.82, 0.36, 0.56), 2]

3

(2) [(0.4, 0.6, 0.7), 1] (1)

2 0.44 0.12 0.28 Thus, the required shortest path is 1 2 5 6

S (0.44, 0.12, 0.28) = =0.68

3

Among the temporary labels [(0.6, 0.09, 0.04), 3] or

[(0.82, 0.36, 0.56), 2], [(0.44, 0.12, 0.28), 3] and since the rank [(0.6,0.09, 0.04), 3]

[(0.2,0.3, 0.4), 1]

of (0.82, 0.36, 0.56), is less than of (0.44, 0.12, 0.28) and (0.6, (0.5,0.3, 0.1) 4

0.09, 0.04). So the status of node 5 is changed to permanent. (0.2,0.3, 0.4) 3

(0.3,0.2, 0.6) [(0.93,0.18, 0.17), 5]

1

2

list of labeled nodes ( temporary and permanent) becomes [(0.,1, 1), -] (0.4,0.6, 0.7)

6

(0.6,0.5, 0.3)

Nodes label Status 2 5

1 P (0.7,0.6, 0.8)

[ (0,1,1) , -] [(0.4,0.6, 0.7), 1] [(0.82,0.36, 0.56), 2]

2 [(0.4, 0.6, 0.7), 1] P FIG 2. Network with single valued neutrosophic shortest

3 [(0.2, 0.3, 0.4), 1] P distance of each node from node 1

4 [(0.6, 0.09, 0.04), 3] T VI. CONCLUSION

415

to Bipolar Single Valued Neutrosophic Graph Theory. Applied Mechanics

and Materials, vol.841, 2016, 184-191.

This paper extended the fuzzy Dijkstras algorithm to find the [22] S. Broumi, M. Talea, F. Smarandache and A. Bakali, Single Valued

shortest path of a network with single valued neutrosophic Neutrosophic Graphs: Degree, Order and Size, 2016 IEEE International

edge weights. The use of neutrosophic numbers as weights in Conference on Fuzzy Systems (FUZZ), 2016, pp.2445-2451

the graph express more uncertainty than fuzzy numbers. The [23] F. Smarandache, Symbolic Neutrosophic Theory, Europanova asbl,

proposed algorithm proposes solution to one issue, this issue Brussels, 2015, 195p.

is addressed by identification of shortest path in neutrosophic [24] S. Broumi, Bakali, M. Talea, and F. Smarandache, A. Computation of

Shortest Path Problem in a Network with Single Valued Neutrosophic

environment. A numerical example was used to illustrate the

Number Based on Ranking Method, 2016 (submitted)

efficiency of the proposed method. In future, we will research [25] S. Broumi, A. Bakali, M. Talea and F. Smarandache, M. Ali,

the application of this algorithm. Shortest Path Problem Under Bipolar Neutrosophic Setting, 2016 (submitted).

[26] S. Broumi, A. Bakali M. Talea, F. Smarandache, and, Shortest Path

Acknowledgment Problem Under Interval Valued Neutrosophic Setting , 2016 (submitted)

The authors are very grateful to the chief editor and reviewers [27] N.Bhatia, Algorithms for Some Fuzzy Network Problems Using

Ranking Function, ( master Thesis, Thapar university Pataiala-

for their comments and suggestions, which is helpful in 147004(PUNJAB), School of Mathematics and Computer Applications,

improving the paper. 2009.

REFERENCES

[1] F. Smarandache, A unifying field in logic. Neutrosophy:

neutrosophic probability, set and logic, American Research Press,

Rehoboth, 1998.

[2] F. Smarandache, A geometric interpretation of the neutrosophic

set A generalization of the intuitionistic fuzzy set, Granular

Computing (GrC), 2011 IEEE International Conference, 2011, pp.602

606 .

[3] L. Zadeh, Fuzzy sets. Inform and Control, 8, 1965, pp.338-353

[4] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems, vol.

20, 1986, pp. 87-96.

[5] I. Turksen, Interval valued fuzzy sets based on normal forms, Fuzzy

Sets and Systems, vol. 20,1986, pp. 191-210.

[6] K. Atanassov and G. Gargov, Interval valued intuitionistic fuzzy sets.

Fuzzy Sets and Systems, vol.31, 1989, pp.343-349.

[7] H. Wang, F. Smarandache, Y. Zhang, and R. Sunderraman,

Single valued Neutrosophic Sets, Multisspace and Multistructure 4, 2010,

pp. 410-413.

[8] http://fs.gallup.unm.edu/NSS

[9] A. Thamaraiselvi and R.Santhi, A New Approach for

Optimization of Real Life Transportation Problems in Neutrosophic

Environment, Mathematical Problems in Enginnering,2016, 9 pages.

[10] P. Chi and P. Liu, An extended TOPSIS method for the multiple

attribute decision making problems based on interval neutrosophic

set,Neutrosophic Set and Systems,1, 2013, pp. 1-8.

[11] P. Jayagowri and G. Geetha Ramani, Using Trapezoidal Intuitionistic

Fuzzy Number to Find Optimized Path in a Network, Volume 2014,

Advances in Fuzzy Systems, 2014, 6 pages.

[12] A. Kumar and M. Kaur, A New Algorithm for Solving Shortest Path

Problem on a Network with Imprecise Edge Weight, Applications and

Applied Mathematics, Vol. 6, Issue 2, 2011, pp. 602 619.

[13] A. Kumar, and M. Kaur, Solution of fuzzy maximal flow

problems using fuzzy linear programming. World Academy of Science

and Technology. 87: 28-31, (2011).

[14] S. Majumder and A. Pal, Shortest Path Problem on Intuitionistic Fuzzy

Network, Annals of Pure and Applied Mathematics, Vol. 5, No. 1, November

2013, pp. 26-36.

[15] S. Okada and M. Gen, Fuzzy shortest path problems, Computers and

Industrial Engineering, vol 27, N1-4, 1994, pp.465-468.

[16] E.W.Dijikstra, A note on two problems in connexion with

graphs,Numerishe Mathematik, 11959, pp. 269-271.

[17] S. Broumi, M. Talea, A. Bakali, F. Smarandache, Single Valued

Neutrosophic Graphs, Journal of New Theory, N 10, 2016, pp. 86-101.

[18] S. Broumi, M. Talea, A. Bakali, F. Smarandache, On Bipolar Single

Valued Neutrosophic Graphs, Journal of New Theory, N11, 2016, pp.84-102.

[19] S. Broumi, M. Talea, A. Bakali, F. Smarandache, Interval Valued

Neutrosophic Graphs, (2016) in press.

[20] S. Broumi, A. Bakali, M, Talea, and F, Smarandache, Isolated Single

Valued Neutrosophic Graphs. Neutrosophic Sets and Systems, Vol. 11, 2016,

pp.74-78

[21] S. Broumi, F. Smarandache, M. Talea and A. Bakali, An Introduction

416

- Discrete Math IntroductionUploaded byjive_gumela
- Discrete Structures Syllabus 2018 AnaveUploaded byDaisy Jean Abas Castillo
- Implementation of Dijkstra’s Shortest Path Algorithm in C++ _ Programming Techniques.pdfUploaded byangel
- yuan2009.pdfUploaded byGaurav Kumar
- Aldrian Text SearchingUploaded byMauliadi
- Antiderivatives cal se cso ricoUploaded byCharlie Von Brawn
- 12 Graphs ShortestPathUploaded byfrankjamison
- shortest Path ProblemsUploaded byoureducation.in
- ProgramsUploaded byVineet Rajput
- Daa mcqsUploaded byShashi Vardhan
- Optimization Multicast Routing Problem by Enabled Virtualization Rendezvous PointUploaded byhaider nafaa
- Vijay Daa Record FinelUploaded byravi
- UCS 732 ppt on graphs MSTs and Shortest paths Dijkstra Bellman ford.pdfUploaded byViney Gupta
- Final All-pairs Shortest PathsUploaded byamit_coolbuddy20
- honeycomb.pdfUploaded byAziz Jarrouj
- History Match Case Study_Use of Assisted History Match Tools on Single Well Models in Conjunction With a Full - Field History Match_sahni2010Uploaded byLee Eun Bin
- Solution 1Uploaded byforwarddump
- L29_Dynamic Programming (continued).pptUploaded byNirmit
- ADA_LabUploaded byRajkiran Boppana
- Operations Research Model.pptUploaded bykrishhhhh0079547
- math 8 long range plans 2019-2020Uploaded byapi-302976262
- SV Static constraints and soft constraints.pptxUploaded byk k
- IncludeUploaded byShahrooz Jutt
- Hamiltonian GraphsUploaded bymmrmathsiubd
- ProgramsUploaded byDeepak Verma
- OR643_SYST521 Syllabus Fall 2013Uploaded byspacejam420
- Geodesic sUploaded byGavrila Emylyan
- Maths 3.3Uploaded byKathy Wong
- MOP_PSOUploaded byjaved765
- polylog -2 derivationUploaded byapi-442477702

- Neutrosophic Sets and Systems. Book series, vol. 23 / 2018Uploaded byAnonymous 0U9j6BLllB
- Neutrosophic Sets and Systems. Book series, vol. 22 / 2018Uploaded byAnonymous 0U9j6BLllB
- TOPSIS Method for MADM based on Interval Trapezoidal Neutrosophic NumberUploaded byAnonymous 0U9j6BLllB
- VIKOR based MAGDM Strategy with Trapezoidal Neutrosophic NumbersUploaded byAnonymous 0U9j6BLllB
- Extension of Soft Set to Hypersoft Set, and then to Plithogenic Hypersoft SetUploaded byAnonymous 0U9j6BLllB
- Operators on Single Valued Trapezoidal Neutrosophic Numbers and SVTN-Group Decision MakingUploaded byAnonymous 0U9j6BLllB
- The Basic Notions for (over, off, under) Neutrosophic Geometric Programming ProblemsUploaded byAnonymous 0U9j6BLllB
- Some Neutrosophic Probability DistributionsUploaded byAnonymous 0U9j6BLllB
- Optimization of EOQ Model with Limited Storage Capacity by Neutrosophic Geometric ProgrammingUploaded byAnonymous 0U9j6BLllB
- Validation of the pedagogical strategy for the formation of the competence entrepreneurshipin high education through the use of neutrosophic logic and Iadov techniqueUploaded byAnonymous 0U9j6BLllB
- Single Valued Neutrosophic Hesitant Fuzzy Computational Algorithm for Multiobjective Nonlinear Optimization ProblemUploaded byAnonymous 0U9j6BLllB
- Extensions to Linguistic Summaries Indicators based on Neutrosophic TheoryUploaded byAnonymous 0U9j6BLllB
- A New Neutrosophic Cognitive Map with Neutrosophic Sets on ConnectionsUploaded byAnonymous 0U9j6BLllB
- On Single Valued Neutrosophic Signed Digraph and its applicationsUploaded byAnonymous 0U9j6BLllB
- A framework for selecting cloud computing services based on consensus under single valued neutrosophic numbersUploaded byAnonymous 0U9j6BLllB
- Gaussian single-valued neutrosophic numbers and its application in multi-attribute decision makingUploaded byAnonymous 0U9j6BLllB
- On single-valued co-neutrosophic graphsUploaded byAnonymous 0U9j6BLllB
- Sinos River basin social-environmental prospective assessment of water quality management using fuzzy cogmitive maps and neutrosophic AHP-TOPSISUploaded byAnonymous 0U9j6BLllB
- Positive implicative BMBJ-neutrosophic ideals in BCK-algebrasUploaded byAnonymous 0U9j6BLllB
- Performance Evaluation of Mutual Funds Via Single Valued Neutrosophic Set (SVNS) Perspective: A Case Study in TurkeyUploaded byAnonymous 0U9j6BLllB
- On Neutrosophic Crisp Topology via N-TopologyUploaded byAnonymous 0U9j6BLllB
- Neutrosophic Soft Normed Linear SpacesUploaded byAnonymous 0U9j6BLllB
- Neutrosophic Soft Cubic Set in Topological SpacesUploaded byAnonymous 0U9j6BLllB
- Neutrosophic Shortest Path ProblemUploaded byAnonymous 0U9j6BLllB
- MBJ-neutrosophic structures and its applications in BCK/BCI-algebrasUploaded byAnonymous 0U9j6BLllB
- Intrusion Detection System and Neutrosophic Theory for MANETs: A Comparative StudyUploaded byAnonymous 0U9j6BLllB
- A new approach for multi-attribute decision-making problems in bipolar neutrosophic setsUploaded byAnonymous 0U9j6BLllB
- Algebraic Structure of Neutrosophic Duplets in Neutrosophic RingsUploaded byAnonymous 0U9j6BLllB

- JAR20092-6.pdfUploaded bySaray Mora
- Expansion PortfolioUploaded byNikki Bito-on
- Customer Engagement: A Case Study Arpita MehtaUploaded byAnonymous EnIdJO
- Time Series DecompositionUploaded byGagan Deep Singh
- IFEM.Ch15Uploaded byJemene
- MCQP FinalUploaded by_hola-chico_
- An AnalysisUploaded byDonales Alnur
- Questions to Ask in a Job Interview (and What Not to Ask)Uploaded byBrenda
- Comparisons - In Class ExerciseUploaded byVikas Singh
- Oracle Succession PlanningUploaded byhamdy2001
- Mo 04-Kasus Forecasting (2)Uploaded byDarwin Naghthauruzmann Chabuthonomoeena
- vol5_1_2007Uploaded byAnda Bacanu
- Chapter 02Uploaded byAditi Yadav
- Turkish Online Journal of Educational TechnologyUploaded byRina Puspita
- 003 Esker Guidebook AP SAP-USUploaded byaaditya01
- AMOS — Statistics SolutionsUploaded byAli Alia
- Hospitals Healthcare IndiaUploaded byRama Krishna
- Dr. James Gallagher's Concern for Gifted Learners Beyond AcademicsUploaded byFika_n
- IPF- ERS StatementUploaded byAnonymous so6ZnlKyw
- Reliability & ValidityUploaded byadmbad2
- Appraisal of Multilevel Car Parking Facility at Kg Road-cbd Area, Bengaluru CityUploaded byInternational Journal of Research in Engineering and Technology
- DigitalUploaded byDarshan N
- JMRH Volume 2 Issue 4 Pages 220-226Uploaded byAzi Sami
- 219494E.pdfUploaded byRobi'ahAlAdawiyyah
- oto01072Uploaded byVladislav Glazkov
- RPG Case studyUploaded byravichand100
- HW-3Uploaded byTarique Hasan Khan
- Project Report - Role of Communication in Effective Change Management (a Case Study of Godrej Group)Uploaded byRashmi Rawat
- Difference Between Questionnaire and in...Th Comparison Chart) - Key DifferencesUploaded bySens March
- Beethoven's Symphony No. 9.pdfUploaded byTRẦN ĐĂNG KHOA

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.