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) ...

Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities comprising data. We formalise notion connection two vertex sets in terms edge and features by introducing graph-walking programs. give algorithms for mining deterministic programs that yield order increasing length. These characterise linear long-distance given context who...

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.

the objective of this paper is to deal with the fuzzy conic program- ming problems. the aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. toward this end, the convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. un- der this setting, duality t...

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, ...

numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...