In this paper d2 degree of a vertex and total d2 -degree of a vertex in an intuitionistic fuzzy graphs are defined. Also (2, (c1, c2))-regularity and totally (2, (c1, c2))-regularity of an intuitionistic fuzzy graphs are defined. A relation between (2, (c1, c2))-regularity and totally (2, (c1, c2))-regularity on intuitionistic fuzzy graph is studied. (2, (c1, c2))regularity on a path on four ve...

We establish secure domination in bipolar hesitancy fuzzy graph. extend the concept to total and 2- Further some theorems examples related are discussed.

This paper describes a method for discovering substructures in data using a fuzzy graph match. A previous implementation of the Subdue system discovers substructures based on the psychologically-motivated criteria of cognitive savings, compactness, connec-tivity and coverage. However, the instances in the data must exactly match the discovered substructures. We describe a new implementation of ...

The rapid growth of RDF (Resource Description Framework) data shows a steady trendy of decentralization. Identify correspondences among these data sources is an important task. Concentrating on the RDF data with fuzzy information, in this paper, we propose a unified framework combined multiple measures of similarity for automatically solving the problem of fuzzy RDF data matching. For this purp...

The paper presents a scalable and generalized approach to social network analysis using fuzzy graph theory. It proposes an intelligent sociocentric that calculates the degree of potential relationship finite size by proposing model. takes into account entity functional relational attributes simultaneously. computes in two steps. first step pairwise between all nodes or entities incorporating pr...