The concepts of neighbourly irregular neutrosophic graphs, neighbourly totally irregular neutrosophic graphs, highly irregular neutrosophic graphs and highly totally irregular neutrosophic graphs are introduced. A criteria for neighbourly... more
The concepts of neighbourly irregular neutrosophic graphs, neighbourly totally irregular neutrosophic graphs, highly irregular neutrosophic graphs and highly totally irregular neutrosophic graphs are introduced. A criteria for neighbourly irregular and highly irregular neutrosophic graphs to be equivalent is discussed.
Research Interests:
The aim of this paper is to propose a new type of graph called neutrosophic soft graphs. We have established a link between graphs and neutrosophic soft sets. Basic operations of neutrosophic soft graphs such as union, intersection and... more
The aim of this paper is to propose a new type of graph called neutrosophic soft graphs. We have established a link between graphs and neutrosophic soft sets. Basic operations of neutrosophic soft graphs such as union, intersection and complement are defined here. The concept of strong neutrosophic soft graphs is also discussed in this paper.
Research Interests:
Research Interests:
Research Interests:
Soft set theory and rough set theory are two new tools to discuss uncertainty. Graph theory is a nice way to depict certain information. Particularly soft graphs serve the purpose beautifully. In order to discuss uncertainty in soft... more
Soft set theory and rough set theory are two new tools to discuss uncertainty. Graph theory is a nice way to depict certain information. Particularly soft graphs serve the purpose beautifully. In order to discuss uncertainty in soft graphs, some new types of graphs called soft covering based rough graphs are introduced. Several basic properties of these newly defined graphs are explored. Applications of soft covering based rough graphs in decision making can be very fruitful. In this regard an algorithm has been proposed.