In this paper, 2−bondage set of a fuzzy graph G is defined. The 2−bondage number, b2(G) is the minimum cardinality among all 2−bondage sets of G. The condition for a 2−bondage set of a fuzzy graph to be a bondage set is also given. The exact values of b2(G) is determined for several classes of fuzzy graphs.

In this paper, the concept of a fuzzy graph structure is introduced based on the concept of graph structure given by E. Sampathkumar, in Bull. Kerala Math. Assoc., Vol 3, No.2 (2006 December), 65123. New concepts like ρi − edge, ρi − path, ρi − cycle, ρi − tree, ρi − forest, fuzzy ρi − cycle, fuzzy ρi − tree, fuzzy ρi − forest etc. are introduced. Some results are obtained. We continue the stud...

Let D be the minimum dominating set of intuitionistic fuzzy graph G. The minimum intuitionistic fuzzy cardinality of all edge dominating set of intuitionistic fuzzy graph G is known as edge domination number and it is denoted by γe(G). In this Paper, we initiate some definitions onedge dominating set concerning intuitionistic fuzzy sets. Further, we investigate some results onedge domination nu...

Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. They rely on graphs that jointly represent each data point. The problem of how to best formulate the graph representation remains an open research topic. In this paper, we introduce a type-2 fuzzy arithmetic to characterize the edge weights of a form...

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.