A vertex v in a connected fuzzy graph G is a fuzzy detour boundary vertex of a vertex u, if ) , ( ) , ( v u w u Δ ≤ Δ for every fuzzy detour neighbour w of v. This paper is devoted to see how the fuzzy detour boundary vertices are related to fuzzy detour interior vertices. Further, the relation between the fuzzy detour boundary vertices and fuzzy detour eccentric vertices are also studied. Some...

In a recent paper we studied how a fuzzy measure can be defined from a fuzzy graph. In this paper we explore its applicability to information retrieval, and, more specifically, to compute similarities between sets of words.

Graph clustering is a very popular research field with numerous practical applications. Here we focus on finding fuzzy clusters of nodes in unweighted, undirected, and irreflexive graphs. We introduce three new algorithms for fuzzy graph clustering (Newman–Girvan NERFCM, Small World NERFCM, Signal NERFCM). Each of these three new algorithms uses a popular algorithm for crisp graph clustering an...

In 2004, G. Ganesan and C. Raghavendra Rao introduced the concept of Rough Fuzzy Groups. In this paper, we have adapted this approach in defining the algebraic closure of a given fuzzy graph using each vertex.

In graph-based linear dimensionality reduction algorithms, it is crucial to construct a neighbor graph that can correctly reflect the relationship between samples. This paper presents an improved algorithm called fuzzy local maximal marginal embedding (FLMME) for linear dimensionality reduction. Significantly differing from the existing graph-based algorithms is that two novel fuzzy gradual gra...

This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an graph a number graphs. The dominant in graphs has some limitations that are studied, derived..

In the present paper, we study some properties of fuzzy norm of linear operators. At first the bounded inverse theorem on fuzzy normed linear spaces is investigated. Then, we prove Hahn Banach theorem, uniform boundedness theorem and closed graph theorem on fuzzy normed linear spaces. Finally the set of all compact operators on these spaces is studied.

In this study, we proposed a method to find the fuzzy reliability of the network using fuzzy sum-of-disjoint product technique. We use the fuzzy graph theory techniques for addressing the reliability of a network with known minimal paths. We have also presented an efficient algorithm to find the reliability of the network.

The theory of graphs are very useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. In this paper, we present a frame work to handle m-polar fuzzy information by combining the theory of m-polar fuzzy sets with graphs. We introduce the notion of weak self complement m-polar fuzzy graphs and establish a necessary condition...