Neutrosophic Soft Rough Graphs with Application

Rough set theory and neutrosophic set theory are mathematical models to deal with incomplete and vague information. These two theories can be combined into a framework for modeling and processing incomplete information in information systems. Thus, the neutrosophic rough set hybrid model gives more precision, flexibility and compatibility to the system as compared to the classic and fuzzy models. In this research study, we develop neutrosophic rough digraphs based on the neutrosophic rough hybrid model. Moreover, we discuss regular neutrosophic rough digraphs, and we solve decision-making problems by using our proposed hybrid model. Finally, we give a comparison analysis of two hybrid models, namely, neutrosophic rough digraphs and rough neutrosophic digraphs.

show abstract

“…For other notations and applications, readers are referred to [19][20][21][22][23][24][25][26][27][28][29][30][31][32]. Definition 3.…”

Section: Definitionmentioning

confidence: 99%

Decision-Making Approach Based on Neutrosophic Rough Information

et al. 2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…Tong He introduced further rough theoretic properties of rough graphs [18] and representation forms of rough graphs [19]. Some other hybrid structures of rough graphs like soft rough graphs, neutrosophic soft rough graphs, intuitionistic fuzzy rough graphs are also introduced in [20][21][22].…”

Section: Introductionmentioning

confidence: 99%

Vertex rough graphs

Mathew

John

Garg

2020

Complex Intell. Syst.

View full text Add to dashboard Cite

This article introduces the notion of vertex rough graph and discusses certain basic graph theoretic definitions and examples. Adjacency of vertices is used to create a matrix corresponding to a vertex rough graph. Also, the membership function of a vertex rough graph is introduced with the help of Pawlak's Rough set theory, and using this certain results are obtained. The concepts of rough precision and rough similarity degree are extended to vertex rough graphs.

show abstract

“…Maji et al (2002Maji et al ( -2003 [4,5] extended some operations of soft set and effectively used this technique in a decision-making problem. Soft set with decision making have studied by many researchers [7][8][9][10][11].…”

Section: Introductionmentioning

confidence: 99%

On Soft Rough Topology with Multi-Attribute Group Decision Making

et al. 2019

Self Cite

View full text Add to dashboard Cite

Rough set approaches encounter uncertainty by means of boundary regions instead of membership values. In this paper, we develop the topological structure on soft rough set ( SR -set) by using pairwise SR -approximations. We define SR -open set, SR -closed sets, SR -closure, SR -interior, SR -neighborhood, SR -bases, product topology on SR -sets, continuous mapping, and compactness in soft rough topological space ( SRTS ). The developments of the theory on SR -set and SR -topology exhibit not only an important theoretical value but also represent significant applications of SR -sets. We applied an algorithm based on SR -set to multi-attribute group decision making (MAGDM) to deal with uncertainty.

show abstract

Neutrosophic Soft Rough Graphs with Application

Cited by 10 publications

References 29 publications

Decision-Making Approach Based on Neutrosophic Rough Information

Decision-Making Approach Based on Neutrosophic Rough Information

Vertex rough graphs

On Soft Rough Topology with Multi-Attribute Group Decision Making

Contact Info

Product

Resources

About