0 views

Uploaded by Anonymous 0U9j6BLllB

In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods of construction of new single-valued co-neutrosophic graphs. We compute degree of a vertex, strong single-valued co-neutrosophic graphs and complete single-valued co-neutrosophic graphs. We also introduce and give properties of regular and totally regular single-valued co-neutrosophic graphs.

- NEWS03
- coherent incoherent text.pdf
- 2_Stat_Mech_Complex_Systems_2019_NetworksBasics.pdf
- Energy Diagrams 1-- Introduction
- cal2
- v6-1389-1393
- Finals 2011 Solutions
- The Structure and Function of Complex Networks
- matematicas del final
- Book
- Exploiting Symmetry in Complex Network Analysis
- Week 6 Assignment
- Mihalcea
- A Hierarchical Approach to Designing Approximate Reasoning-Based Controllers for Dynamic Physical Systems
- *MaTh*7.4 Examples
- Page Rank Calculator In Java
- 12 Graphs Post (excerpt CS135)
- 1
- IJFLS
- Interval neutrosophic sets and topology

You are on page 1of 8

University of New Mexico

R.Dhavaseelan 1, S. Jafari 2, M. R. Farahani3 , S. Broumi 4

1

Department of Mathematics, Sona College of Technology, Salem-636005, Tamil Nadu, India. E-mail

dhavaseelan.r@gmail.com

2

Department of Mathematics, College of Vestsjaelland South, Herrestraede 11, 4200 Slagelse, Denmark. E-mail:

jafaripersia@gmail.com

3

Department of Applied Mathematics,Iran University of Science and Technology, Iran. E-mail: mrfarahani88@gmail.com

4

Laboratory of Information Processing, Faculty of Science Ben MSik,University Hassan II, B.P 7955, Sidi Othman,

Casablanca, Morocco

E-mail: broumisaid78@gmail.com

Abstract: In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods

of construction of new single-valued co-neutrosophic graphs. We compute degree of a vertex, strong single-valued

co-neutrosophic graphs and complete single-valued co-neutrosophic graphs. We also introduce and give properties of

regular and totally regular single-valued co-neutrosophic graphs.

Keywords: Single-valued neutrosophic graphs; degree of a vertex; strong single-valued co-neutrosophic graphs;

complete single-valued co-neutrosophic graphs; regular and totally regular single-valued co-neutrosophic graphs.

Zadeh [21] introduced the concepts of fuzzy set theory as a generalized concept of crisp set theory. The concept

of fuzzy graph theory as a generalization of Eulers graph theory was first introduced by Rosenfeld [17] in 1975.

Later, Bhattacharya [5] gave some remarks on fuzzy graphs. The concept of cofuzzy graphs by M. Akram [1].

The concepts of intuitionistic cofuzzy graph by Dhavaseelan [9]. Smarandache [20] introduced the concept of

neutrosophic sets. Certain types of neutrosophic graphs were introduced by R. Dhavaseelan et al. [10].Some

more work in single valued neutrosophic set,interval valued neutrosophic set and their application may be

found in Karaaslan,et .al., [13], Hamidi,et .al., [11, 14], Broumi, et.al., [6–8, 15] and Shimaa Fathi,et.al [18].

Kandasamy, et.al [12], introduced the new dimension of neutrosophic graph.

In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods

of construction of new single-valued co-neutrosophic graphs. We compute degree of a vertex, strong single-

valued co-neutrosophic graphs and complete single-valued co-neutrosophic graphs. We also introduce and

give properties of regular and totally regular single-valued co-neutrosophic graphs.

Definition 1.1. [19] Let X be a space of points. A neutrosophic set A in X is characterized by a truth-

membership function TA (x), an indeterminacy membership function IA (x) and a falsity membership function

FA (x). The functions TA (x), IA (x)and FA (x) are real standard or non standard subsets of ]0− , 1+ [. That is,

181 Neutrosophic Sets and Systems, Vol. 22, 2018

TA (x) : X →]0− , 1+ [, IA (x) : X →]0− , 1+ [,FA (x) : X →]0− , 1+ [ and 0− ≤ TA (x) + IA (x) + FA (x) ≤ 3+ .

From philosophical point view, the neutrosophic set takes the value from real standard or non standard subsets

of ]0− , 1+ [. In real life applications in scientific and engineering problems, it is difficult to use neutrosophic

set with value from real standard or non standard subset of ]0− , 1+ [.

Definition 1.2. [2, 4] A single-valued neutrosophic graph is a pair G = (A, B), where A : V → [0, 1] is

single-valued neutrosophic set in V and B : V × V → [0, 1] is single-valued neutrosophic relation on V such

that

TB (xy) ≤ min{TA (x), TA (y)} IB (xy) ≤ min{IA (x), IA (y)} FB (xy) ≥ max{FA (x), FA (y)}

for all x, y ∈ V . A is called single-valued neutrosophic vertex set of G and B is called single-valued neu-

trosophic edge set of G, respectively. We note that B is symmetric single-valued neutrosophic relation on A.

If B is not symmetric single-valued neutrosophic relation on A, then G = (A, B) is called a single-valued

neutrosophic directed graph.

Definition 2.1. A single-valued co-neutrosophic graph is a pair G = (A, B), where A : V → [0, 1] is a single-

valued co-neutrosophic set in V and B : V × V → [0, 1] is a single-valued co-neutrosophic relation on V such

that

TB (xy) ≥ max{TA (x), TA (y)}

IB (xy) ≥ max{IA (x), IA (y)}

FB (xy) ≤ min{FA (x), FA (y)}

for all x, y ∈ V . A and B are called the single-valued co-neutrosophic vertex set of G and the single-valued

co-neutrosophic edge set of G, respectively. We note that B is a symmetric single-valued co-neutrosophic

relation on A. If B is not a symmetric single-valued co-neutrosophic relation on A, then G = (A, B) is called

a single-valued co-neutrosophic directed graph.

Notation 2.1. The triples hTA (x), IA (x), FA (x)i denotes the degree of membership, an indeterminacy member-

ship and nonmembership of vertex x, The triples hTB (xy), IB (xy), FB (xy)i denote the degree of membership,

an indeterminacy membership and nonmembership of edge relation xy = (x, y) on V .

Definition 2.2. A partial single-valued co-neutrosophic subgraph of single-valued co-neutrosophic graph G =

(A, B) is a single-valued co-neutrosophic graph H = (V 0 , E 0 ) such that

(i) V 0 ⊆ V , where TA0 (vi ) ≤ TA (vi ), IA0 (vi ) ≤ IA (vi ), FA0 (vi ) ≥ FA (vi ) for all vi ∈ V .

0 0 0

(ii) TB (xy) ≤ TB (xy);IB (xy) ≤ IB (xy); FB (xy) ≥ FB (xy) for every x and y

0 0

Definition 2.3. A single-valued co-neutrosophic graph H = hA , B i is said to be a single-valued co-neutrosophic

0 0

subgraph of the single-valued co-neutrosophic graph G = hA, Bi if A ⊆ A and B ⊆ B. In other words if

0 0 0 0 0 0

TA (x) = TA (x);IA (x) = IA (x); FA (x) = FA (x) and TB (xy) = TB (xy);IB (xy) = IB (xy); FB (xy) =

FB (xy) for every x and y

Neutrosophic Sets and Systems, Vol. 22, 2018 182

e

(0.6,0.6,0.3)

(0.7,0.7,0.2)

(0.6,0.6,0.3)

(0.5,0.5,0.4) (0.7,0.7,0.3)

a b

(0.6,0.6,0.3)

(0.5, 0.5, 0.4) (0.6, 0.6, 0.4)

e

(0.6,0.6,0.3)

(0.5,0.5,0.4)

(0.5,0.5,0.4)

(0.5,0.5,0.4) (0.6,0.6,0.3)

a b

(0.6,0.6,0.4)

(0.4, 0.4, 0.5) (0.5, 0.5, 0.5)

Definition 2.4. A single-valued co-neutrosophic graph G = hA, Bi is said to be strong single-valued co-

neutrosophic graph if TB (xy) = max(TA (x), TA (y)),IB (xy) = max(IA (x), IA (y)) and FB (xy) = min(FA (x), FA (y)),

for all (xy) ∈ E.

Definition 2.5. A single-valued co-neutrosophic graph G = hA, Bi is said to be complete single-valued co-

neutrosophic graph if TB (xy) = max(TA (x), TA (y)), IB (xy) = max(IA (x), IA (y)) and FB (xy) = min(FA (x), FA (y)),

for every x, y ∈ V .

P graph. Then the degree

P of a vertex v

is definedPby d(v) = (dT (v), dI (v), dF (v)), where dT (v) = u6=v TB (u, v), dI (v) = u6=v IB (u, v) and

dF (v) = u6=v FB (u, v)

Definition 2.7. The minimum degree of G is δ(G) = (δT (G), δI (G), δF (G)), where δT (G) = min{dT (v)|v ∈

V }, δI (G) = min{dI (v)|v ∈ V } and δF (G) = max{dF (v)|v ∈ V }

183 Neutrosophic Sets and Systems, Vol. 22, 2018

e

(0.6,0.6,0.3)

(0.6,0.6,0.3)

(0.7,0.7,0.3)

a b

(0.6,0.6,0.3)

(0.5, 0.5, 0.4) (0.6, 0.6, 0.4)

(0.6,0.6,0.4)

(0.5, 0.5, 0.5) b d (0.6, 0.6, 0.4)

)

.3

,0

.6

,0

.6

(0

(0.6,0.6,0.3) (0.6,0.6,0.4)

(0

.5

,0

.5

,0

.4

)

(0.6, 0.6, 0.3) a c (0.5, 0.5, 0.4)

(0.6,0.6,0.3)

Definition 2.8. The maximum degree of G is ∆(G) = (∆T (G), ∆I (G), ∆F (G)), where ∆T (G) = max{dT (v)|v ∈

V }, ∆I (G) = max{dI (v)|v ∈ V } and ∆F (G) = min{dF (v)|v ∈ V }

The degrees are dT (a) = 1.6, dI (a) = 1.6, dF (a) = 1.0, dT (c) = 1.3, dI (c) = 1.3, dF (c) = 0.5, dT (d) =

1.7, dI (d) = 1.7, dF (d) = 1.1, dT (b) = 1.0, dI (b) = 1.0, dF (b) = 0.8.

Minimum degree of a graph is δT (G) = 1.0, δI (G) = 1.0, δF (G) = 1.1

Maximum degree of a graph is ∆T (G) = 1.7, ∆I (G) = 1.7, ∆F (G) = 0.5

Definition 2.9. Let G = hA, Bi be a single-valued co-neutrosophic graph. The total degree of a vertex v ∈ V

is defined as : P P

T d(v) = T dT (v)+T dI (v)+T dF (v), where T dT (v) = (u,v)∈E TB (u, v)+TA (v), T dI (v) = (u,v)∈E IB (u, v)+

P

IA (v) and T dF (v) = (u,v)∈E FB (u, v) + FA (v).

Neutrosophic Sets and Systems, Vol. 22, 2018 184

(0.5,0.5,0.5)

(0.4, 0.4, 0.5) b d (0.3, 0.3, 0.6)

)

.4

,0

.5

,0

.5

(0.5,0.5,0.3) (0.7,0.7,0.2)

(0

(0.5, 0.5, 0.4) a c (0.6, 0.6, 0.4)

(0.6,0.6,0.3)

If each vertex of G has the same total degree (r1 , r2 , r3 ), then G is said to be an (r1 , r2 , r3 ) totally regular

single-valued co-neutrosophic graph.

Definition 2.10. Let G = hA, Bi be a single-valued co-neutrosophic graph. If each vertex has same degree

(r, s, t), then G is called (r, s, t) regular single-valued co-neutrosophic graph. Thus r = dT (v), s = dI (v), t =

dF (v);for v ∈ V .

Example 2.2. Let G = hA, Bi be a single-valued co-neutrosophic graph. Draw as below

(0.7,0.7,0.3)

(0.3, 0.3, 0.5) y v (0.5, 0.5, 0.4)

)

.4

,0

.5

,0

.5

(0

(0.6,0.6,0.4) (0.6,0.6,0.4)

(0

.5

,0

.5

,0

.4

)

(0.4, 0.4, 0.5) x u (0.5, 0.5, 0.4)

(0.7,0.7,0.3)

d(y) = (1.8, 1.8, 1.1), d(v) = (1.8, 1.8, 1.1), d(u) = (1.8, 1.8, 1.1), d(x) = (1.8, 1.8, 1.1). So, G is a

regular single-valued co-neutrosophic graph. But G is not totally regular single-valued co-neutrosophic graph.

Since T d(y) = 5.8 6= 6.1 = T d(v).

Remark 2.1. (a) For a single-valued co-neutrosophic graph, H = (A,B) to be both regular & totally regular,

the number of vertices in each edge must be same.

(b) And also each vertex lies in exactly same number of edges.

Proposition 2.1. Let G = hA, Bi be a single-valued co-neutrosophic graph. Then TA : V → [0, 1], IA : V →

[0, 1], FA : V → [0, 1] is a constant function iff following are equivalent.

185 Neutrosophic Sets and Systems, Vol. 22, 2018

Proof. suppose that (TA , IA , FA ) is a constant function. Let TA (vi ) = k1 , IA (vi ) = k2 , FA (vi ) = k3 for

all vi ∈ V . Assume that G is a (r1 , r2 , r3 ) regular single-valued co-neutrosophic graph. Then dT (vi ) =

r1 , dI (vi ) = r2 , dF (vi ) = r3 for all vi ∈ V . So T d(vi ) = T dT (vi ) + T dI (vi ) + T dF (vi )

T dT (vi ) = dT (vi ) + TA (vi ), for all vi ∈ V

= r1 + k1 = c1 .

T dI (vi ) = dI (vi ) + IA (vi ), for all vi ∈ V

= r2 + k2 = c2 .

T dF (vi ) = dF (vi ) + FA (vi ), for all vi ∈ V

= r3 + k3 = c3 .

Hence G is totally regular single-valued co-neutrosophic graph. Thus (1) ⇒ (2) is proved.

Now, suppose that G is a (t1 , t2 , t3 ) totally regular single-valued co-neutrosophic graph, then T dT (vi ) =

t1 , T dT (vi ) = t2 , T dF (vi ) = t3 for all vi ∈ V .

T dT (vi ) = dT (vi ) + TA (vi ) = t1 ,

⇒ dT (vi ) = t1 − TA (vi ) = t1 − k1 , for all vi ∈ V .

Similarly, T dI (vi ) = dI (vi ) + IA (vi ) = t2 ,

⇒ dI (vi ) = t2 − IA (vi ) = t2 − k2 , for all vi ∈ V .

⇒ dF (vi ) = t3 − FA (vi ) = t3 − k3 , for all vi ∈ V . So, G is a regular single-valued co-neutrosophic graph.

Thus (2) ⇒ (1) is proved. Hence (1) and (2) are equivalent.

Proposition 2.2. If a single-valued co-neutrosophic graph is both regular and totally regular, then (TA , IA , FA )

is constant function.

Proof. Let G be a (r, s, t) regular and (k1 , k2 , k3 ) totally regular single-valued co-neutrosophic graphs. So,

dT (v1 ) = r, dI (v1 ) = s, dF (v1 ) = t for v1 ∈ V and T dT (v1 ) = k1 , T dI (v1 ) = k2 , T dF (v1 ) = k3 for all

v1 ∈ V . Now,

T dT (v1 ) = k1 , for all v1 ∈ V,

dT (v1 ) + TA = k1 , for all v1 ∈ V,

r + TA (v1 ) = k1 , for all v1 ∈ V,

TA (v1 ) = k1 − r, for all v1 ∈ V.

Hence TA (v1 ) is a constant function.

Similarly, IA (v1 ) = k2 − s for all v1 ∈ V and FA (v1 ) = k3 − t for all v1 ∈ V . Hence (TA , IA , FA ) is a

constant.

3 Conclusion

In this paper, we introduced the notion of a single-valued co-neutrosophic graphs and study some methods of

construction of new single-valued co-neutrosophic graphs. We computed degree of a vertex, strong single-

valued co-neutrosophic graphs and complete single-valued co-neutrosophic graphs. Properties of regular and

Neutrosophic Sets and Systems, Vol. 22, 2018 186

totally regular single-valued co-neutrosophic graphs are discussed. In future, we are introduce and discuss the

energy of Single-valued co-neutrosophic graphs.

References

[1] M. Akram, Cofuzzy graphs, The Journal of Fuzzy Mathematics, 3(4)(2011), 877-888.

[2] M. Akram and S. Shahzadi, Neutrosophic soft graphs with application, Journal of Intelligent & Fuzzy

Systems, 32(1)(2017), 841-858.

[3] M. Akram, Single-valued neutrosophic planar graphs, International Journal of Algebra and Statistics,

5(2)(2016), 157-167.

[4] M. Akram and G. Shahzadi, Operations on single-valued neutrosophic graphs, Journal of Uncertain

System, 11(2)(2017), 1-26.

[5] P. Bhattacharya, Some remarks on fuzzy graphs, Pattern Recognition Letter, 6(1987), 297-302.

[6] Broumi, S., Smarandache, F. , Talea, M. , Bakali, A. Operations on Interval Valued Neutrosophic Graphs.

In F. Smarandache, & S. Pramanik (Eds., vol.2), New trends in neutrosophic theory and applications (pp.

231-254). Brussels: Pons Editions.

[7] Broumi, S., Talea, M., Bakkali, A., Samarandache, F.: Single valued neutrosophic graph. Journal of New

Theory 10, 86101 (2016).

[8] Broumi, S., Mohamed Talea,Assia Bakali, Florentin Smarandache. Single Valued Neutrosophic Graphs.

In F. Smarandache, & S. Pramanik (Eds., vol.2),New trends in neutrosophic theory and applications (pp.

187-202). Brussels: Pons Editions.

ing & IT, 1(6)(2014), 1-6.

[10] R. Dhavaseelan, R. Vikramaprasad and V. Krishnaraj, Certain types of neutrosophic graphs, International

Journal of Mathematical Sciences and Applications, 5(2)(2015), 333-339.

[11] M. Hamidi, A. Borumand Saeid. Accessible single-valued neutrosophic graphs. Journal of Applied Math-

ematics and Computing 57, Issue 12, pp 121146, 2018.

[12] Kandasamy, W.B.V, Ilanthenral, K., Smarandache, F.: Neutrosophic graphs: a new dimension to graph

theory, Europo Nova, Belgium. (2015).

[13] Karaaslan, Faruk, Davvaz, Bijan. Properties of single-valued neutrosophic graphs. Journal of Intelligent

& Fuzzy Systems, vol. 34, no. 1, pp. 57-79, 2018.

[14] Mohammad Hamidi, and Arsham Borumand Saeid. Achievable Single-Valued Neutrosophic Graphs

in Wireless Sensor Networks. New Mathematics and Natural Computation VOL. 14, NO. 02

https://doi.org/10.1142/S1793005718500114

187 Neutrosophic Sets and Systems, Vol. 22, 2018

[15] Nasir Shah, Said Broumi: Irregular Neutrosophic Graphs, Neutrosophic Sets and Systems, vol. 13, 2016,

pp. 47-55. doi.org/10.5281/zenodo.570846

[16] A. Nagoorgani and K. Radha, The degree of a vertex in some fuzzy graphs, International journal of

Algorithm, Computing and Mathematics, 2(3)(2009), 107-116.

[17] A. Rosenfeld, Fuzzy graphs, Fuzzy sets and their applications (L. A. Zadeh, K. S. Fu, M. Shimura, Eds.),

Academic Press, New York, (1975), 77-95.

[18] Shimaa Fathi, Hewayda ElGhawalby, A.A. Salama. A Neutrosophic Graph Similarity Measures. In F.

Smarandache, & S. Pramanik (Eds., vol.2), New trends in neutrosophic theory and applications (pp.

203-230). Brussels: Pons Editions.

[19] Smarandache,F., A Unifying field in logics neutrosophy:Neutrosophic Probability,set and logic, Re-

hoboth: American Research Press,1998.

[20] F. Smarandache, Neutrosophy and Neutrosophic Logic, First International Conference on Neutrosophy,

Neutrosophic Logic, Set, Probability and Statistics University of New Mexico, Gallup, NM 87301, USA

(2002).

- NEWS03Uploaded byaliscribd46
- coherent incoherent text.pdfUploaded byHameed Al-zubeiry
- 2_Stat_Mech_Complex_Systems_2019_NetworksBasics.pdfUploaded byCarlo Polato
- Energy Diagrams 1-- IntroductionUploaded byJaneFree
- cal2Uploaded byPattrawut Rukkachart
- v6-1389-1393Uploaded byAmin Nzi
- Finals 2011 SolutionsUploaded byRayner Harold Montes Condori
- The Structure and Function of Complex NetworksUploaded bymariesantini
- matematicas del finalUploaded byChecoz
- BookUploaded byAline Guedes
- Exploiting Symmetry in Complex Network AnalysisUploaded byMessiasBruno
- Week 6 AssignmentUploaded bySumant Srivastava
- MihalceaUploaded byankit
- A Hierarchical Approach to Designing Approximate Reasoning-Based Controllers for Dynamic Physical SystemsUploaded byVehid Tavakol
- *MaTh*7.4 ExamplesUploaded byCA-Math-Teach
- Page Rank Calculator In JavaUploaded byParvezAhmed Kazi
- 12 Graphs Post (excerpt CS135)Uploaded bynot_perfect001
- 1Uploaded byengr_n_n_malik
- IJFLSUploaded byAnonymous LSebPS
- Interval neutrosophic sets and topologyUploaded byMia Amalia
- L22Uploaded byKat Hawthorne
- (1) Introduction to the Limit.pptxUploaded bychristina santos
- GraphTheory.pdfUploaded byAnubhav Chaturvedi
- large graph mining tools.pdfUploaded byEnayat Ansari
- ase-knowlean advanced cdge architecture based on fuzzy objectsUploaded byspitraberg
- Fuzzy Petri NetsUploaded byHaris Qureshi
- Graph Algorithms ScreenUploaded byRaj Gupta
- Lecture 3 Fuzzy LogicUploaded byMary Morse
- Cole PersichitteUploaded byanapegetti
- BFS DFSUploaded bymadhurimapatra1987

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

- 9.docxUploaded bydicko
- T-79_4202_solutions_4Uploaded bybobopower
- Cp5151 Advanced Data Structures and AlgorithimsUploaded byகாட்டுப்புலி மணிவண்ணன்
- CSE5311_FinalExamPracticeUploaded byVIVEK
- Facility LayoutUploaded byAsif Raza
- Prim's AlgorithmUploaded byCabigting Jeremiah
- Barrackpore Rastraguru Surendranath CollegeUploaded bymady_kohli
- Santana El Arte de Programar en RUploaded byRicardo Echeverría B.
- 3 Mathematics TSC Curriculum Secondary 2072 Fagun 28Uploaded byRameshprasad Lamichhane
- Errata-2008.pdfUploaded byAtul Kumbhar
- A Study of Vertex Edge Coloring Techniques With ApplicationUploaded byIjcemJournal
- solu8Uploaded byBasil Aziz Tinah
- roofing design.docxUploaded byrhon
- 14cs10011Uploaded byArijit Panigrahy
- Discrete Mathematics Testbank With AnskeyUploaded byjocansino4496
- C Program to Find Shortest Path Using DijkstraUploaded byKosta Nikolic
- KG2018-Lecture-01-print.pdfUploaded byParham
- GraphsUploaded byAkshay Singh
- PrintPlayPencilNPaper12Uploaded bybbscribed
- 1483633011473.pdfUploaded byEzequiel Nicolás Starecinch
- Paper Counting Spanning Trees in Threshold GraphsUploaded byKhanif Anwari
- Graph Theory & Combinatorics Jun 2010Uploaded byPrasad C M
- course plan DSGTUploaded byShashank Naik
- West - 2nd Edition - Solution ManualUploaded bySimon Ammanuel
- Lecture_12.pdfUploaded byRamesh Dongara
- What Algorithms Need to Know in Order to Become a Good ProgrammerUploaded byMarco Zubieta
- SNDPUploaded byAncd Desa
- ParabolaUploaded byYolanda Ruiz
- Fundamental Loops and Cut Sets - GATE Study Material in PDFUploaded byTestbook Blog
- UCLA Math 61 final reviewUploaded byfatfakernig