The depletion of natural resources in the last century now threatens our planet and the life of future generations. For the sake of sustainable development, this paper pioneers an interesting and practical problem of dense substructure (i.e., maximal cliques) mining in a fuzzy graph where the edges are weighted by the degree of membership. For parameter 0 ≤ λ ≤ 1 (also called fuzzy cut in fuzzy...

A fuzzy graph (f-graph) is a pair G : (σ, μ) where σ is a fuzzy subset of a set S and μ is a fuzzy relation on σ. A fuzzy graph H : (τ, υ) is called a partial fuzzy subgraph of G : (σ, μ) if τ (u) ≤ σ(u) for every u and υ (u, v) ≤ μ(u, v) for every u and v . In particular we call a partial fuzzy subgraph H : (τ, υ) a fuzzy subgraph of G : (σ, μ ) if τ (u) = σ(u) for every u in τ * and υ (u, v) ...

Fuzzy graph structures being an application of fuzzy sets to graph structures, are profusely applicable in social science and environmental science. A neutrosophic graph structures are more flexible and precise as compared to fuzzy graph structures. They are extensively helpful in decision-making problems. In this paper, we present concept of single-valued intuitionistic neutrosophic graph stru...

Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

A fuzzy graph is utilized to characterize the role played by an individual member in such a group that a class of group members having relationship with any given member has no sharply defined boundary. The concepts of weakening and strengthening points of an ordinary graph presented by Ross and Harary are generalized to those of a fuzzy graph.

In this paper, we introduce two new algorithm to find a Hamilton Circuit in a graph G = (V, E). One algorithm is use a multistage graph as a special NFAs to find all Hamilton Circuit in exponential time; while another is use O(|V|) variant multistage graph as a special state set NFAs to find a fuzzy data of all Hamilton Circuit in polynomial time. The fuzzy data of the data contain those data, ...