Neutrosophic competition graphs with applications

Akram, Muhammad; Siddique, Saba

doi:10.3233/jifs-162207

Cited by 31 publications

(20 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The neutrosophic graph [12] can efficiently model the inconsistent information about any real-life problem. Recently, many researchers have more actively worked on neutrosophic graph theory; for instance, Ye [29], Yang et al [30], Naz et al [31], Broumi [15], and Arkam [32][33][34][35].…”

Section: Introductionmentioning

confidence: 99%

A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

Huang

et al. 2019

Mathematics

View full text Add to dashboard Cite

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results. The concepts of the regularity and degree of a node play a significant role in both the theory and application of graph theory in the neutrosophic environment. In this work, we describe the utility of the regular neutrosophic graph and bipartite neutrosophic graph to model an assignment problem, a road transport network, and a social network. For this purpose, we introduce the definitions of the regular neutrosophic graph, star neutrosophic graph, regular complete neutrosophic graph, complete bipartite neutrosophic graph, and regular strong neutrosophic graph. We define the d m - and t d m -degrees of a node in a regular neutrosophic graph. Depending on the degree of the node, this paper classifies the regularity of a neutrosophic graph into three types, namely d m -regular, t d m -regular, and m-highly irregular neutrosophic graphs. We present some theorems and properties of those regular neutrosophic graphs. The concept of an m-highly irregular neutrosophic graph on cycle and path graphs is also investigated in this paper. The definition of busy and free nodes in a regular neutrosophic graph is presented here. We introduce the idea of the μ -complement and h-morphism of a regular neutrosophic graph. Some properties of complement and isomorphic regular neutrosophic graphs are presented here.

show abstract

Section: Introductionmentioning

confidence: 99%

A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

Huang

et al. 2019

Mathematics

View full text Add to dashboard Cite

show abstract

“…Mordeson and Peng [8] presented operations on fuzzy graphs. Akram et al, [9][10][11][12] considered several new concepts of neutrosophic graphs with applications. Rough fuzzy digraphs with applications are presented in [13,14].…”

Section: Introductionmentioning

confidence: 99%

Decision-Making Approach Based on Neutrosophic Rough Information

et al. 2018

Self Cite

View full text Add to dashboard Cite

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

“…Mordeson and Peng [10] presented operations on fuzzy graphs. Akram et al [11][12][13][14] considered several new concepts of neutrosophic graphs with applications. Zafer and Akram [15] dealt with rough fuzzy digraphs with applications.…”

Section: Introductionmentioning

confidence: 99%

Notions of Rough Neutrosophic Digraphs

et al. 2018

Self Cite

View full text Add to dashboard Cite

Graph theory has numerous applications in various disciplines, including computer networks, neural networks, expert systems, cluster analysis, and image capturing. Rough neutrosophic set (NS) theory is a hybrid tool for handling uncertain information that exists in real life. In this research paper, we apply the concept of rough NS theory to graphs and present a new kind of graph structure, rough neutrosophic digraphs. We present certain operations, including lexicographic products, strong products, rejection and tensor products on rough neutrosophic digraphs. We investigate some of their properties. We also present an application of a rough neutrosophic digraph in decision-making.

show abstract

Neutrosophic competition graphs with applications

Cited by 31 publications

References 23 publications

A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications

Decision-Making Approach Based on Neutrosophic Rough Information

Notions of Rough Neutrosophic Digraphs

Contact Info

Product

Resources

About