Interval-Valued Neutrosophic Graph Representation of Concept Lattice and Its ( $$\alpha ,\beta ,\gamma $$ α , β , γ )-Decomposition

2017 ◽  
Vol 43 (2) ◽  
pp. 723-740 ◽  
Author(s):  
Prem Kumar Singh
2010 ◽  
Vol 2010 ◽  
pp. 1-27 ◽  
Author(s):  
María Elena Acevedo ◽  
Cornelio Yáñez-Márquez ◽  
Marco Antonio Acevedo

Alpha-beta bidirectional associative memories are implemented for storing concept lattices. We use Lindig's algorithm to construct a concept lattice of a particular context; this structure is stored into an associative memory just as a human being does, namely, associating patterns. Bidirectionality and perfect recall of Alpha-Beta associative model make it a great tool to store a concept lattice. In the learning phase, objects and attributes obtained from Lindig's algorithm are associated by Alpha-Beta bidirectional associative memory; in this phase the data is stored. In the recalling phase, the associative model allows to retrieve objects from attributes or vice versa. Our model assures the recalling of every learnt concept.


2017 ◽  
Vol 6 (1-2) ◽  
pp. 22 ◽  
Author(s):  
Muhammad Akram ◽  
Maryam Nasir

Broumi et al. [15] proposedthe concept of interval-valued neutrosophic graphs. In this research article, we first show that there are some flaws in Broumi et al. [15] ’s definition which violates condition of an interval. We then modify the definition of an interval-valued neutrosophic graph. We present some operations on interval-valued neutrosophic graphs. We discuss the concepts of self-complementary and self weak complementary interval-valued neutrosophic complete graphs. We also describe regularity of interval-valued neutrosophic graphs.


Mathematics ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 72 ◽  
Author(s):  
Naeem Jan ◽  
Kifayat Ullah ◽  
Tahir Mahmood ◽  
Harish Garg ◽  
Bijan Davvaz ◽  
...  

Fuzzy graphs (FGs) and their generalizations have played an essential role in dealing with real-life problems involving uncertainties. The goal of this article is to show some serious flaws in the existing definitions of several root-level generalized FG structures with the help of some counterexamples. To achieve this, first, we aim to improve the existing definition for interval-valued FG, interval-valued intuitionistic FG and their complements, as these existing definitions are not well-defined; i.e., one can obtain some senseless intervals using the existing definitions. The limitations of the existing definitions and the validity of the new definitions are supported with some examples. It is also observed that the notion of a single-valued neutrosophic graph (SVNG) is not well-defined either. The consequences of the existing definition of SVNG are discussed with the help of examples. A new definition of SVNG is developed, and its improvement is demonstrated with some examples. The definition of an interval-valued neutrosophic graph is also modified due to the shortcomings in the current definition, and the validity of the new definition is proved. An application of proposed work is illustrated through a decision-making problem under the framework of SVNG, and its performance is compared with existing work.


2017 ◽  
Vol 6 (1-2) ◽  
pp. 56 ◽  
Author(s):  
Muhammad Akram ◽  
Muzzamal Sitara

In this research article, we apply the concept of interval-valued neutrosophic sets to graph structures. We present the concept of interval-valued neutrosophic graph structures. We describe certain operations on interval-valued neutrosophic graph structures and elaborate them with appropriate examples. Further, we investigate some relevant properties of these operators. Moreover,we propose some open problems on interval-valued neutrosophic line graph structures.


Sign in / Sign up

Export Citation Format

Share Document