Southeast Asian Bulletin of Mathematics (2016) 40: 151–170 Southeast Asian

Bulletin of
Mathematics
c SEAMS. 2016

Fuzzy Soft Trees

Muhammad Akram and Fariha Zafar

Department of Mathematics, University of the Punjab, New Campus, Lahore, Pakistan
Email: m.akram@pucit.edu.pk; fariha zafar09@ymail.com

Received 3 July 2015

Accepted 4 December 2015

Communicated by Zaw Win

AMS Mathematics Subject Classification(2000): 05C99, 03E72

Abstract. Fuzzy sets and soft sets are two different methods for representing uncer-
tainty and vagueness. In this article, we apply these methods in combination to study
uncertainty and vagueness in graphs. We introduce the notions of fuzzy soft cycles,
fuzzy soft bridge, fuzzy soft cutnode, fuzzy soft trees, and investigate some of their
fundamental properties. We also study some types of arcs in fuzzy soft graphs.

Keywords: Fuzzy soft cycles; Fuzzy soft bridge; Fuzzy soft cutnode; Fuzzy soft trees.

1. Introduction

Molodtsov [21] initiated the concept of soft set theory as a new mathematical
tool for dealing with uncertainties. It has been demonstrated that soft sets have
potential applications in various fields such as the smoothness of functions, game
theory, operations research, Riemann integration, Perron integration, probability
theory, and measurement theory [21]. Since then research on soft sets has been
very active and received much attention from researchers worldwide. Feng et al.
[17] combined soft sets with rough sets and fuzzy sets, obtaining three types of
hybrid models: rough soft sets, soft rough sets, and soft-rough fuzzy sets. Ali et
al. [11] discussed the fuzzy sets and fuzzy soft sets induced by soft sets. Maji
et al.[19] presented the definition of fuzzy soft sets and Roy et al. [24] presented
some applications of this notion to decision making problems.
A notion having certain influence on graph theory is fuzzy set, which is in-
troduced by Zadeh [26] in 1965. Fuzzy graph theory is finding an increasing
number of applications in modeling real time systems where the level of infor-
152 M. Akram and F. Zafar

mation inherent in the system varies with different levels of precision. Fuzzy
models are becoming useful because of their aim in reducing the differences be-
tween the traditional numerical models used in engineering and sciences and
the symbolic models used in expert systems. Kaufmann’s initial definition of a
fuzzy graph [18] was based on Zadeh’s fuzzy relations [26]. Bhattacharya [12]
gave some remarks on fuzzy graphs. Mordeson and Nair [22] defined the concept
of complement of fuzzy graph and studied some operations on fuzzy graphs.
Akram et al.[1-5] introduced many new concepts, including bipolar fuzzy
graphs, strong intuitionistic fuzzy graphs, intuitionistic fuzzy hypergraphs, in-
tuitionistic fuzzy trees and fuzzy soft graphs. Recently, Akram and Zafar intro-
duced [9, 10] the notions of soft trees , fuzzy soft trees, soft cycle, soft bridge,
soft cutnodes, and discussed some of their properties. In this article, we apply
these methods in combination to study uncertainty and vagueness in graphs and
trees. We introduce the notions of fuzzy soft cycles, fuzzy soft bridge, fuzzy soft
cutnode, fuzzy soft trees, and investigate some of their fundamental properties.
We also study some types of arcs in fuzzy soft graphs.

2. Preliminaries

We first review some elementary concepts of graphs that are necessary for this
paper.
By a graph, we mean a pair G∗ = (V, E), where V is the set and E is a
relation on V . The elements of V are vertices of G∗ and the elements of E are
edges of G∗ . We call V (G∗ ) the vertex set and E(G∗ ) the edge set of G∗ . We
write xy ∈ E to mean {x, y} ∈ E, and if e = xy ∈ E, we say x and y are
adjacent. Formally, given a graph G∗ = (V, E), two vertices x, y ∈ V are said
to be neighbors, or adjacent nodes, if xy ∈ E. A subgraph of a graph G∗ is a
graph, each of whose vertices belongs to V (G∗ ) and each of whose edges belongs
to E(G∗ ).
For any subset S of a vertex set of the graph G∗ , the induced subgraph S
is the subgraph of G∗ whose vertex set is S and two vertices are adjacent in S
if and only if they are adjacent in G∗ . A path in a graph G∗ is an alternating
sequence of vertices and edges v0 , e1 , v1 , e2 , · · · ,vn−1 , en , vn . The path graph
with n vertices is denoted by Pn . A path is sometime denoted by Pn : v0 v1 · · · vn
(n > 0). The length of a path Pn in G∗ is n. A path Pn : v0 v1 · · · vn in G∗ is
called a cycle if v0 = vn and n ≥ 3. Note that path graph, Pn , has n − 1 edges
and can be obtained from cycle graph, Cn , by removing any edge.

Definition 2.1. [21] A pair S = (F, A) is called a soft set over U , where A ⊆ P
is a parameter set and F : A → P(U ) is a set-valued mapping, called the
approximate function of the soft set S. In other words, a soft set over U is a
parameterized family of subsets of U . For any ǫ ∈ A, F (ǫ) may be considered as
set of ǫ-approximate elements of soft set (F, A).
Fuzzy Soft Trees 153

Maji et al. [19] defined fuzzy soft set in the following way.

Definition 2.2. Let U be an initial universe, P the set of all parameters, A ⊂ P

and P(U ) the collection of all fuzzy subsets of U . Then (Fe , A) is called fuzzy
soft set, where Fe : A → P(U ) is a mapping, called fuzzy approximate function
of the fuzzy soft set (Fe, A).

3. Fuzzy Soft Trees

e = (G∗ , Fe, K,
Definition 3.1. [5] A fuzzy soft graph G e A) is a 4-tuple such that

(a) G∗ = (V, E) is a simple graph,

(b) A is a nonempty set of parameters,
(c) (Fe , A) is a fuzzy soft set over V ,
(d) e A) is a fuzzy soft set over E,
(K,
(e) (Fe (a), K(a))
e is a fuzzy graph of G∗ for all a ∈ A. That is,

e
K(a)(xy) ≤ min{Fe (a)(x), Fe (a)(y)}

for all a ∈ A and x, y ∈ V . The fuzzy graph (Fe (a), K(a))

e is denoted by
e
H(a) for convenience.

e for a fuzzy soft graph

In what follows, we will use G∗ for a simple graph, G
e
and H for fuzzy graph.

Example 3.2. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 , a4 }

and E = {a1 a2 , a2 a3 , a3 a4 , a4 a1 }. Let A = {e1 , e2 } be a set of parameters. Let
(Fe, A) be a fuzzy soft set over V with its fuzzy approximate function Fe : A →
P(V ) given by

Fe(e1 ) = {(a1 , 0.2), (a2 , 0.3), (a3 , 0.5), (a4 , 0.6)},

Fe(e2 ) = {(a1 , 0.3), (a2 , 0.5), (a3 , 0.7), (a4 , 0.6)}.

e A) be a fuzzy soft set over E with its fuzzy approximate function K

Let (K, e :
A → P(E) given by

e 1 ) = {(a1 a2 , 0.2), (a2 a3 , 0.2), (a3 a4 , 0.4), (a4 a1 , 0.1)},

K(e
e 2 ) = {(a1 a2 , 0.3), (a2 a3 , 0.5), (a3 a4 , 0.6), (a4 a1 , 0.2)}.
K(e

e 1 ) = (Fe (e1 ), K(e

Thus, H(e e 1 )) and H(e
e 2 ) = (Fe (e2 ), K(e
e 2 )) are fuzzy graphs of
∗
G as shown in the Fig. 1. It is easy to verify that G e = (G∗ , Fe , K,
e A) is a fuzzy
soft graph.
154 M. Akram and F. Zafar

a1 (0.2) 0.2 a 2 (0.3) a1 (0.3) 0.3 a 2 (0.5)

0.1 0.2 0.2 0.5

a3 (0.5) a4 (0.6) a3 (0.7)

a4 (0.6) 0.4 0.6

e 1 ) and H(e
Figure 1: Fuzzy graphs H(e e 2)

Definition 3.3. A fuzzy soft graph G e is a fuzzy soft tree if each fuzzy graph
e e e
H(ei ) = (F (ei ), K(ei )) ∀ei ∈ A has a fuzzy spanning subgraph Q(e e i) =
(Fe(ei ), Te(ei )) which is a tree, where for all arcs xy not in Q(e
e i ), K(e
e i )(xy) <
CON NQ(e e i) (xy).

Example 3.4. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 } and
E = {a1 a2 , a2 a3 , a3 a1 }. Let A = {e1 , e2 } be a set of parameters. Let (Fe , A) be
a fuzzy soft set over V with its fuzzy approximate function Fe : A → P(V ) given
by

Fe (e1 ) = {(a1 , 0.3), (a2 , 0.7), (a3 , 0.5)},

Fe (e2 ) = {(a1 , 0.4), (a2 , 0.3), (a3 , 0.8)}.
e A) be a fuzzy soft set over E with its fuzzy approximate function K
Let (K, e :
A → P(E) given by
e 1 ) = {(a1 a2 , 0.3), (a2 a3 , 0.4), (a3 a1 , 0.2)},
K(e
e 2 ) = {(a1 a2 , 0.2), (a2 a3 , 0.1), (a3 a1 , 0.3)}.
K(e

Thus, H(ee 1 ) = (Fe (e1 ), K(e

e 1 )) and H(e
e 2 ) = (Fe (e2 ), K(e
e 2 )) are fuzzy graphs of
∗ e
G as shown in the Fig. 2. As H(e1 ) has a spanning fuzzy subgraph Q(e e 1) =
e e e
(F (e1 ), T (e1 )) which is a tree and the arc a3 a1 is not present in Q(e1 ) as shown
in the Fig. 3.
satisfies the following inequality,
e 1 )(a3 a1 ) = 0.2 < CON N e (a3 a1 ) = 0.3.
K(e Q(e1 )

e 2 ) has a spanning fuzzy subgraph Q(e

Also H(e e 2 ) = (Fe(e2 ), Te(e2 )) which is a
e
tree and the arc a2 a3 is not present in Q(e2 ) as shown in the Fig. 4.
satisfies the following inequality,
e 2 )(a2 a3 ) = 0.1 < CON N e (a2 a3 ) = 0.2.
K(e Q(e2 )
Fuzzy Soft Trees 155

a1 (0.3) a1 (0.4)

0.3 0.2 0.2 0.3

a2 (0.7) 0.4 a 3 (0.5) a2(0.3) 0.1 a 3 (0.8)

e 1 ) and H(e
Figure 2: Fuzzy trees H(e e 2)

a1 (0.3)

0.3

a2 (0.7) 0.4 a 3 (0.5)

e 1)
Figure 3: Spanning fuzzy subgraph Q(e

a1 (0.4)

0.2 0.3

a2(0.3) a 3 (0.8)

e 2)
Figure 4: Spanning fuzzy subgraph Q(e

e 1 ) and H(e
Therefore, H(e e 2 ) are also fuzzy trees. Thus, G
e = (G∗ , Fe, K,
e A) is a
fuzzy soft tree.

Example 3.5. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 , a4 }

and E = {a1 a2 , a2 a4 , a2 a3 , a3 a4 , a4 a1 }.
Let A = {e1 , e2 , e3 } be a set of parameters. Then the fuzzy graphs of G∗
corresponding to parameters e1 , e2 , e3 are given below and shown as in the Fig. 5.
e 1 ) = (Fe (e1 ), K(e
H(e e 1 )) = ({(a1 , 0), (a2 , 0.3), (a3 , 0.5), (a4 , 0.2)},
{(a1 a2 , 0), (a2 a4 , 0.2), (a2 a3 , 0.3), (a3 a4 , 0.1), (a4 a1 , 0)}),
H(e2 ) = (Fe (e2 ), K(e
e e 2 )) = ({(a1 , 0.3), (a2 , 0.5), (a3 , 0.6), (a4 , 0.7)},
{(a1 a2 , 0.3), (a2 a4 , 0), (a2 a3 , 0.4), (a3 a4 , 0.5), (a4 a1 , 0.2)}),
e 3 ) = (Fe (e3 ), K(e
H(e e 3 )) = ({(a1 , 1), (a2 , 0.7), (a3 , 0.4), (a4 , 1)},
156 M. Akram and F. Zafar

{(a1 a2 , 0.5), (a2 a4 , 0.4), (a2 a3 , 0.3), (a3 a4 , 0), (a4 a1 , 1)})
e 1 ) has a spanning fuzzy subgraph Q(e
As H(e e 1 ) = (Fe(e1 ), Te(e1 )) which is a tree

a 2 (0.3) a1 (0.3) 0.3 a 2 (0.5) a1 (1) 0.5 a 2 (0.7)

0.2 0.4
0.3 0.2 0.4 1 0.3

a4 (0.2) a3 (0.5) a3 (0.6) a3 (0.4)

0.1 a4 (0.7) 0.5 a4 (1)

e 1 ), H(e
Figure 5: Fuzzy trees H(e e 2 ), H(e
e 3)

e 1 ) as shown in the Fig. 6. satisfies the

and the arc a3 a4 is not present in Q(e

a 2 (0.3)

0.2
0.3

a4 (0.2) a3 (0.5)

e 1)
Figure 6: Spanning fuzzy subgraph Q(e

following inequality,
e 1 )(a3 a4 ) = 0.1 < CON N e (a3 a4 ) = 0.2.
K(e Q(e1 )

e 1 ) is a fuzzy tree. Similarly, H(e

Therefore, H(e e 2 ) and H(e
e 3 ) are also fuzzy trees.
e ∗ e e
Thus, G = (G , F , K, A) is a fuzzy soft tree. Tabular representation of G e is
given in the following Table 1.

A\V a1 a2 a3 a4 A\E a1 a2 a2 a4 a2 a3 a3 a4 a4 a1
e1 0 0.3 0.5 0.2 e1 0 0.2 0.3 0.1 0
e2 0.3 0.5 0.6 0.7 e2 0.3 0 0.4 0.5 0.2
e3 1 0.7 0.4 1 e3 0.5 0.4 0.3 0 1

e
Table 1: Tabular representation of a fuzzy soft graph G

Definition 3.6. A fuzzy soft graph G e is a fuzzy soft cycle if each fuzzy graph
e e e
H(ei ) = (F (ei ), K(ei )) ∀ei ∈ A is a fuzzy cycle, i.e., if and only if every graph
e ∗ (ei ) = (Fe∗ (ei ), K
H e ∗ (ei )) is a cycle and there does not exist a unique arc xy ∈
e ∗ (ei ) such that
K
e i )(xy) = min{K(e
K(e e i )(ab)|ab ∈ K
e ∗ (ei )}.
Fuzzy Soft Trees 157

Example 3.7. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 , a4 , a5 }

and E = {a1 a2 , a2 a3 , a3 a4 , a4 a5 , a5 a1 }. Let A = {e1 , e2 } be a set of parame-
ters. Let (Fe, A) be a fuzzy soft set over V with its fuzzy approximate function
Fe : A → P(V ) given by

Fe(e1 ) = {(a1 , 0.2), (a2 , 0.3), (a3 , 0.7), (a4 , 0.9), (a5 , 0.6)},
Fe(e2 ) = {(a1 , 0.5), (a2 , 0.3), (a3 , 0.6), (a4 , 0.8), (a5 , 0.4)}.

e A) be a fuzzy soft set over E with its fuzzy approximate function K

Let (K, e :
A → P(E) given by

e 1 ) = {(a1 a2 , 0.1), (a2 a3 , 0.3), (a3 a4 , 0.4), (a4 a5 , 0.5), (a5 a1 , 0.1)},
K(e
e 2 ) = {(a1 a2 , 0.3), (a2 a3 , 0.2), (a3 a4 , 0.6), (a4 a5 , 0.2), (a5 a1 , 0.4)}.
K(e

e 1 ) = (Fe (e1 ), K(e

Thus, H(e e 1 )) is a fuzzy graph of G∗ and also fuzzy cycle as
shown in the Fig. 7. Because H e ∗ (e1 ) is a cycle and there exist two arcs a1 a2
e (e1 ) such that
and a5 a1 in K ∗

e 1 )(a1 a2 ) = 0.1 = min{K(e

K(e e 1 )(ab)|ab ∈ K
e ∗ (e1 )} = K(e
e 1 )(a5 a1 ),

as shown in the Fig. 7.

a1 (0.2)

0.1 0.1

a5 (0.6) a2 (0.3)

0.5 0.3

a (0.9) a3 (0.7)
4 0.4

e 1)
Figure 7: Fuzzy cycle H(e

e 2 ) = (Fe (e2 ), K(e

Similarly, H(e e 2 )) is a fuzzy graph of G∗ and also fuzzy cycle
as shown in the Fig. 8. Because H e ∗ (e2 ) is a cycle and there exist two arcs a2 a3
and a4 a5 in Ke (e2 ) such that
∗

e 2 )(a2 a3 ) = 0.2 = min{K(e

K(e e 2 )(ab)|ab ∈ K
e ∗ (e2 )} = K(e
e 2 )(a4 a5 ),

e = (G∗ , Fe , K,
as shown in the Fig. 8. Thus, G e A) is a fuzzy soft cycle.

e = (G∗ , Fe , K,
Definition 3.8. Let G e A) be a fuzzy soft graph then an arc xy in
e is a fuzzy soft bridge if it is a fuzzy bridge in H(e
G e i ) = (Fe(ei ), K(e
e i )), for
158 M. Akram and F. Zafar

a1 (0.5)

0.4 0.3

a5 (0.4) a2 (0.3)

0.2 0.2

a (0.8) a3 (0.6)
4 0.6

e 2)
Figure 8: Fuzzy cycle H(e

some ei ∈ A. That is, if H e ′ (ei ) = (Fe (ei ), K

e ′ (ei )) is a fuzzy subgraph obtained
e ′
by deleting the arc xy where K (ei )(xy) = 0 and K e ′ (ei )(xy) = K(e
e i )(xy) for all
e
other pairs. Then xy is a fuzzy bridge in H(ei ), for some ei ∈ A, if

CON NHe ′ (ei ) (uv) < CON NH(e

e i ) (uv)

for some u, v ∈ V .

Example 3.9. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 , a4 }

and E = {a1 a2 , a2 a3 , a3 a4 , a4 a1 }. Let A = {e1 , e2 , e3 } be a set of parameters.
Let (Fe, A) be a fuzzy soft set over V with its fuzzy approximate function Fe :
A → P(V ) given by

Fe(e1 ) = {(a1 , 0.3), (a2 , 0.5), (a3 , 0.2), (a4 , 0.6)},

Fe(e2 ) = {(a1 , 0.2), (a2 , 0.6), (a3 , 0.4), (a4 , 0.8)},
Fe(e3 ) = {(a1 , 0.6), (a2 , 0.3), (a3 , 0.5), (a4 , 0.7)}.

e A) be a fuzzy soft set over E with its fuzzy approximate function K

Let (K, e :
A → P(E) given by

e 1 ) = {(a1 a2 , 0.3), (a2 a3 , 0.2), (a3 a4 , 0.1), (a4 a1 , 0.2)},

K(e
e 2 ) = {(a1 a2 , 0.2), (a2 a3 , 0.3), (a3 a4 , 0.4), (a4 a1 , 0.1)},
K(e
e 3 ) = {(a1 a2 , 0.3), (a2 a3 , 0.1), (a3 a4 , 0.5), (a4 a1 , 0.4)}.
K(e

e 1 ) = (Fe(e1 ), K(e
Thus, H(e e 1 )) is a fuzzy graph of G∗ and a1 a2 , a2 a3 , a4 a1 are
e 1 ) since these arcs hold the following inequalities,
fuzzy bridges in H(e

CON NHe ′ (e1 ) (a1 a2 ) = 0.1 < CON NH(e

e 1 ) (a1 a2 ) = 0.3,

CON NHe ′ (e1 ) (a2 a3 ) = 0.1 < CON NH(e

e 1 ) (a2 a3 ) = 0.2,

CON NHe ′ (e1 ) (a4 a1 ) = 0.1 < CON NH(e

e 1 ) (a4 a1 ) = 0.2.
Fuzzy Soft Trees 159

We can further see from the Fig. 9 and Fig. 10.

a1 (0.3) 0.3 a 2 (0.5)

0.2 0.2

a4 (0.6) a3 (0.2)
0.1

e 1)
Figure 9: Fuzzy graph H(e
a1 (0.3) a 2 (0.5) a1 (0.3) a 2 (0.5) a1 (0.3) 0.3 a 2 (0.5)
0.3

0.2 0.2 0.2 0.2

a3 (0.2) a3 (0.2) a4 (0.6) a3 (0.2)

a4 (0.6) 0.1 a4 (0.6) 0.1 0.1

e 1′ (e1 ), H
Figure 10: Fuzzy subgraphs H e 2′ (e1 ), H
e 3′ (e1 )

e Similarly, H(e
Therefore, a1 a2 , a2 a3 , a4 a1 are fuzzy soft bridges of G. e 2) =
e e e e e
(F (e2 ), K(e2 )) and H(e3 ) = (F (e3 ), K(e3 )) are fuzzy graphs as shown in the
Fig. 11 and Fig. 12, respectively.

a1 (0.2) 0.2 a 2 (0.6)

0.1 0.3

a4 (0.8) a3 (0.4)
0.4

e 2)
Figure 11: Fuzzy graph H(e
a1 (0.6) 0.3 a 2 (0.3)

0.4 0.1

a4 (0.7) a3 (0.5)
0.5

e 3)
Figure 12: Fuzzy graph H(e

e 2 ) and hence fuzzy soft bridges of G.

a1 a2 , a2 a3 , a3 a4 are fuzzy bridges of H(e e
160 M. Akram and F. Zafar

e 3 ) and hence fuzzy soft bridges of

And a1 a2 , a3 a4 , a4 a1 are fuzzy bridges of H(e
e
G.

Theorem 3.10. For xy ∈ H(e e i ), for some ei ∈ A, the following statements are
equivalent.
(i) xy is a fuzzy soft bridge,
e i )(xy),
(ii) CON NHe ′ (ei ) (xy) < K(e
e i ).
(iii) xy is not a weakest arc of any cycle in H(e

Proof. If xy is not a fuzzy soft bridge, then xy is not a fuzzy bridge in H(ee i ), we
must have CON NHe ′ (ei ) (xy) = CON NH(e e
e i ) (xy) ≥ K(ei )(xy); thus (ii) implies
(i).
e i ), then any path involving arc xy can
If xy is a weakest arc of a cycle in H(e
be replaced into a path not involving xy but at least as strong; by using the rest
of the cycle as a path from x to y; thus, xy cannot be a fuzzy bridge and hence
not a fuzzy soft bridge, so that (i) implies (iii).
e i )(xy), there is a path from x to y, not involving
If CON NKe ′ (ei ) (xy) ≥ K(e
xy that has strength ≥ K(e e i )(xy) and this path together with xy forms a cycle
of which xy is a weakest arc; thus (iii) implies (ii).

Definition 3.11. Let G e = (G∗ , Fe, K,

e A) be a fuzzy soft graph then a node w in
Ge is a fuzzy soft cutnode if it is a fuzzy cutnode in H(e
e i ) = (Fe(ei ), K(e
e i )), for
e
some ei ∈ A. That is, the deletion of w from H(ei ) reduces the strength of the
connectedness between some other pair of nodes u, v ∈ V ,
e i )−w (uv) < CON NH(e
CON NH(e e i ) (uv).

Example 3.12. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 }

and E = {a1 a2 , a2 a3 , a3 a1 }. Let A = {e1 , e2 } be a set of parameters. Let (Fe , A)
be a fuzzy soft set over V with its fuzzy approximate function Fe : A → P(V )
given by
Fe (e1 ) = {(a1 , 0.3), (a2 , 0.6), (a3 , 0.5)},
Fe (e2 ) = {(a1 , 0.4), (a2 , 0.3), (a3 , 0.5)}.
e A) be a fuzzy soft set over E with its fuzzy approximate function K
Let (K, e :
A → P(E) given by
e 1 ) = {(a1 a2 , 0.1), (a2 a3 , 0.4), (a3 a1 , 0.2)},
K(e
e 2 ) = {(a1 a2 , 0.3), (a2 a3 , 0.1), (a3 a1 , 0.3)}.
K(e
e 1 ) = (Fe(e1 ), K(e
Thus, H(e e 1 )) is a fuzzy graph of G∗ as shown in the Fig. 13
and a3 is a fuzzy cutnode since
e 1 )−a3 (a1 a2 ) = 0.1 < CON NH(e
CON NH(e e 1 ) (a1 a2 ) = 0.2,
Fuzzy Soft Trees 161

and it can be also seen from Fig. 13 and Fig. 14.

a1 (0.3)

0.1 0.2

a2 (0.6) 0.4 a 3 (0.5)

e 1)
Figure 13: Fuzzy graph H(e
a1 (0.3)

0.1

a2 (0.6)

e 1 ) − a3
Figure 14: Fuzzy subgraph H(e

e 2 ) = (Fe (e2 ), K(e

Also H(e e 2 )) is a fuzzy graph of G∗ as shown in the Fig. 15
and a1 is a fuzzy cutnode since

e 2 )−a1 (a2 a3 ) = 0.1 < CON NH(e

CON NH(e e 2 ) (a2 a3 ) = 0.3,

and it can be also seen from Fig. 15 and Fig. 16.

a1 (0.4)

0.3 0.3

a2(0.3) 0.1 a 3 (0.5)

e 2)
Figure 15: Fuzzy graph H(e

a2(0.3) 0.1 a 3 (0.5)

e 2 ) − a1
Figure 16: Fuzzy subgraph H(e

e 1 ) and a1 ∈ H(e
Hence, a3 ∈ H(e e 2 ) are fuzzy soft cutnodes of G.
e
162 M. Akram and F. Zafar

Theorem 3.13. Let G e be a fuzzy soft graph and H(e

e i ) be a fuzzy graph of G
e such
e ∗ e ∗ e ∗
that H (ei ) = (F (ei ), K (ei )) is a cycle. Then a node is a fuzzy soft cutnode
e if and only if it is a common node of two fuzzy soft bridges.
of G

Proof. Let w be a fuzzy soft cutnode of G. e Then there exist u and v, other than
e
w in H(ei ), for some ei ∈ A, such that w is on every strongest u − v path. Now
He ∗ (ei ) = (Fe∗ (ei ), K
e ∗ (ei )) being a cycle, there exists only one strongest u − v
path containing w and all its arcs are fuzzy bridges and hence these arcs are
fuzzy soft bridges of G e . Thus, w is a common node of two fuzzy soft bridges.
Conversely, let w be a common node of two fuzzy soft bridges uw and wv.
Then uw and wv are fuzzy bridges of H(e e i ). Thus, both uw and wv are not
e
the weakest arcs of H(ei ) by the Theorem . Also the path from u to v not
containing arcs uw and wv has strength less than K(e e i )(uw) ∧ K(ee i )(wv). Thus,
the strongest u − v path is the path u, w, v and CON NH(e e
e i ) (uv) = K(ei )(uw) ∧
e i )(wv). Therefore, w is a fuzzy cutnode and hence w is a fuzzy soft cutnode.
K(e

Theorem 3.14. If w is a common node of at least two fuzzy soft bridges, then w
is a fuzzy soft cutnode.

Proof. Let uw and wv be two fuzzy soft bridges. Then uw and wv are fuzzy
e i ), for some ei ∈ A and there exist some x, y such that uw is on
bridges in H(e
every strongest x − y path. If w is distinct from x and y it follows that w is a
fuzzy cutnode. Hence w is a fuzzy soft cutnode. Next, suppose one of x, y is w so
that uw is on every strongest x − w path or wv is on every strongest w − y path.
If possible, let w be not a fuzzy soft cutnode. Then it is not a fuzzy cutnode and
between every two nodes there exists at least one strongest path not containing
w. In particular, there exists at least one strongest path ρ, joining u and v, not
containing w. This path together with uw and wv forms a cycle.
Case 1. If u, w, v is not a strongest path, then clearly one of uw, wv or both
become the weakest arcs of the cycle which contradicts that uw and wv are fuzzy
soft bridges.
Case 2. If u, w, v is also a strongest path joining u to v, then CON NH(e
e i ) (uv)
e e
= K(ei )(uw)∧ K(ei )(wv), the strength of ρ. Thus, arcs of ρ are at least as strong
e i )(uw) and K(e
as K(e e i )(wv) which implies that uw, wv or both are the weakest
arcs of the cycle, which again is a contradiction.

Remark 3.15. The condition in the Theorem in is not true as it can be seen in
the following example.

Example 3.16. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 , a4 , a5 }

and {a1 a2 , a2 a3 , a3 a4 , a4 a1 , a2 a5 , a4 a5 , a3 a5 , a5 a1 }. Let A = {e1 } be a set of pa-
rameters. Let (Fe, A) be a fuzzy soft set over V with its fuzzy approximate
Fuzzy Soft Trees 163

function Fe : A → P(V ) given by

Fe(e1 ) = {(a1 , 0.6), (a2 , 0.7), (a3 , 0.8), (a4 , 0.3), (a5 , 0.5)}.

e A) be a fuzzy soft set over E with its fuzzy approximate function K

Let (K, e :
A → P(E) given by

e 1 ) = {(a1 a2 , 0.2), (a2 a3 , 0.5), (a3 a4 , 0.3), (a4 a1 , 0.3), (a2 a5 , 0.2),
K(e
(a4 a5 , 0.3), (a3 a5 , 0.2), (a5 a1 , 0.5)}.

e 1 ) = (Fe(e1 ), K(e
Thus, H(e e 1 )) is a fuzzy graph of G∗ and a2 a3 , a3 a4 , a5 a1 are
e
fuzzy bridges in H(e1 ) since these edges hold the following inequalities,

CON NHe ′ (e1 ) (a2 a3 ) = 0.2 < CON NH(e

e 1 ) (a2 a3 ) = 0.5,

CON NHe ′ (e1 ) (a3 a4 ) = 0.2 < CON NH(e

e 1 ) (a3 a4 ) = 0.3,

CON NHe ′ (e1 ) (a5 a1 ) = 0.3 < CON NH(e

e 1 ) (a5 a1 ) = 0.5.

We can further see from the Fig. 17 and Fig. 18.

a1 (0.6) 0.2 a 2 (0.7)

0.5 a5 (0.5) 0.2

0.3 0.5
0.3 0.2

a4 (0.3) 0.3
a3 (0.8)

e 1)
Figure 17: Fuzzy graph H(e
a1 (0.6) a 2 (0.7) a1 (0.6) a 2 (0.7) a1 (0.6) 0.2 a 2 (0.7)
0.2 0.2

a5 (0.5) 0.2 a5 (0.5) 0.2 a5 (0.5) 0.2

0.5 0.5
0.3 0.3 0.5 0.3 0.5
0.3 0.2 0.3 0.2 0.3 0.2

a3 (0.8) a3 (0.8) a4 (0.3) a3 (0.8)

a4 (0.3) 0.3 a4 (0.3) 0.3

e ′ (e1 ), H
Figure 18: Fuzzy subgraphs H e ′ (e1 ), H
e ′ (e1 )
1 2 3

e
Therefore, a2 a3 , a3 a4 , a5 a1 are only fuzzy soft bridges of G.
e
a4 is a fuzzy cutnode of H(e1 ) and it is not a common node of two fuzzy
bridges since

e 1 )−a4 (a3 a5 ) = 0.2 < CON NH(e

CON NH(e e 1 ) (a3 a5 ) = 0.3,

and it can be also seen from Fig. 19 and Fig. 20.

164 M. Akram and F. Zafar

a1 (0.6) 0.2 a 2 (0.7)

0.5 a5 (0.5) 0.2

0.3 0.5
0.3 0.2

a4 (0.3) 0.3
a3 (0.8)

e 1)
Figure 19: Fuzzy graph H(e
a1 (0.6) 0.2 a 2 (0.7)

0.5 a5 (0.5) 0.2

0.5
0.2

a3 (0.8)

e 1 ) − a4
Figure 20: Fuzzy subgraph H(e

e and it is not a common node of two

Hence, a4 is a fuzzy soft cutnode of G
fuzzy soft bridges.

e then for H(e

Theorem 3.17. If uv is a fuzzy soft bridge of G, e i ), for some ei ∈ A,
e
e i ) (uv) = K(ei )(uv).
CON NH(e

e i)
Proof. Suppose that uv is a fuzzy soft bridge then uv is a fuzzy bridge in H(e
and CON NH(e e
e i ) (uv) exceeds K(ei )(uv). Then there exists a strongest u − v
e i )(uv) and all arcs of this strongest path
path with strength greater than K(e
e
have strength greater than K(ei )(uv). Now this path together with the arc uv
forms a cycle in which uv is the weakest arc, contradicting the fact that uv is a
fuzzy soft bridge.

Remark 3.18. The condition in the Theorem in is not true as it can be seen in
the following example.

Example 3.19. From previous Example , CON NH(e e

e 1 ) a4 a1 = 0.3 and K(e1 )(a4 a1 ) =

0.3. Hence, CON N e e 1 )(a4 a1 ). But the arc a4 a1 is not a fuzzy

a4 a1 = K(e
H(e1 )
e 1 ). Thus, a4 a1 is not a fuzzy soft bridge of G.
bridge of H(e e We now present
types of arcs in fuzzy soft graphs.

Definition 3.20. An arc xy in H(ee i ), for some ei ∈ A is called α−strong if

e i )(xy) > CON N e
K(e H(ei )−xy (xy).
Fuzzy Soft Trees 165

e i ), for some ei ∈ A is called β−strong if

Definition 3.21. An arc xy in H(e
e
K(ei )(xy) = CON NH(e
e i )−xy (xy).

e i ), for some ei ∈ A is called δ−strong if

Definition 3.22. An arc xy in H(e
e
K(ei )(xy) < CON NH(e
e i )−xy (xy).

e i )(xy) > K(e

Definition 3.23. A δ−arc xy is called a δ ∗ −arc if K(e e i )(uv) where
e
uv is a weakest arc of H(ei ), for some ei ∈ A.

Example 3.24. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 , a4 }

and E = {a1 a2 , a2 a4 , a2 a3 , a3 a4 , a4 a1 }. Let A = {e1 } be a set of parameters.
Let (Fe, A) be a fuzzy soft set over V with its fuzzy approximate function Fe :
A → P(V ) given by

Fe(e1 ) = {(a1 , 0.3), (a2 , 0.4), (a3 , 0.6), (a4 , 0.2)}.

e A) be a fuzzy soft set over E with its fuzzy approximate function K

Let (K, e :
A → P(E) given by

e 1 ) = {(a1 a2 , 0.2), (a2 a4 , 0.2), (a2 a3 , 0.3), (a3 a4 , 0.2), (a4 a1 , 0.1)}.
K(e

e 1 ) = (Fe (e1 ), K(e

Thus, H(e e 1 )) is a fuzzy graph of G∗ and in H(e
e 1 ), the arcs a1 a2
and a2 a3 are α−strong since

e 1 )(a1 a2 ) = 0.2 > CON N e

K(e H(e1 )−a1 a2 (a1 a2 ) = 0.1,
e 1 )(a2 a3 ) = 0.3 > CON N e
K(e H(e1 )−a2 a3 (a2 a3 ) = 0.2.

We can further see from the Fig. 21, Fig. 22 and Fig. 23.

a1 (0.3) 0.2 a 2 (0.4)

0.2
0.1 0.3

a4 (0.2) 0.2 a3 (0.6)

e 1)
Figure 21: Fuzzy graph H(e
166 M. Akram and F. Zafar

a1 (0.3) a 2 (0.4)

0.2
0.1 0.3

a4 (0.2) 0.2 a3 (0.6)

e 1 ) − a1 a2
Figure 22: Fuzzy subgraph H(e
a1 (0.3) 0.2 a 2 (0.4)

0.2
0.1

a4 (0.2) 0.2 a3 (0.6)

e 1 ) − a2 a3
Figure 23: Fuzzy subgraph H(e

e 1 ) since
a2 a4 and a3 a4 are β−strong arcs in H(e

e 1 )(a2 a4 ) = 0.2 = CON N e

K(e H(e1 )−a2 a4 (a2 a4 ) = 0.2,
e 1 )(a3 a4 ) = 0.2 = CON N e
K(e H(e1 )−a3 a4 (a3 a4 ) = 0.2.

We can further see from the Fig. 21, Fig. 24 and Fig. 25.

a1 (0.3) 0.2 a 2 (0.4)

0.1 0.3

a4 (0.2) 0.2 a3 (0.6)

e 1 ) − a2 a4
Figure 24: Fuzzy subgraph H(e
a1 (0.3) 0.2 a 2 (0.4)

0.2
0.1 0.3

a4 (0.2) a3 (0.6)

e 1 ) − a3 a4
Figure 25: Fuzzy subgraph H(e
Fuzzy Soft Trees 167

e 1 ) since
a4 a1 is a δ−strong arc in H(e

e 1 )(a4 a1 ) = 0.1 < CON N e

K(e H(e1 )−a4 a1 (a4 a1 ) = 0.2.

We can further see from the Fig. 21 and Fig. 26.

a1 (0.3) 0.2 a 2 (0.4)

0.2
0.3

a4 (0.2) 0.2 a3 (0.6)

e 1 ) − a4 a1
Figure 26: Fuzzy subgraph H(e

Thus, a1 a2 , a2 a3 are α−strong arcs, a2 a4 , a3 a4 are β−strong arcs, a4 a1 is

e
δ−strong arc and no arc is δ ∗ −strong arc in G.

Theorem 3.25. A fuzzy soft graph is a fuzzy soft tree if and only if it has no β−
strong arcs.

Example 3.26. Consider a simple graph G∗ = (V, E), where V = {a1 , a2 , a3 }

and E = {a1 a2 , a2 a3 , a3 a1 }. Let A = {e1 } be a set of parameters. Let (Fe, A) be
a fuzzy soft set over V with its fuzzy approximate function Fe : A → P(V ) given
by Fe (e1 ) = {(a1 , 0.3), (a2 , 0.7), (a3 , 0.5)}. Let (K,
e A) be a fuzzy soft set over E
with its fuzzy approximate function K e : A → P(E) given by

e 1 ) = {(a1 a2 , 0.3), (a2 a3 , 0.4), (a3 a1 , 0.2)}.

K(e

e 1 ) = (Fe (e1 ), K(e

Thus, H(e e 1 )) is a fuzzy graph of G∗ as shown in Fig. 27.

a1 (0.3)

0.3 0.2

a2 (0.7) 0.4 a 3 (0.5)

e 1)
Figure 27: Fuzzy graph H(e

e 1 ), no arc is β−strong arc. Thus, no arc in G

In H(e e is β−strong arc. There-
e is a fuzzy soft tree.
fore, G
168 M. Akram and F. Zafar

Theorem 3.27. A strong path P in H(e e i ), for some ei ∈ A, of G

e from x to y is
a strongest x − y path in the following cases.
(i) If P contains only α− strong arcs,
(ii) If P is the unique strong x − y path,
e i ) are of equal strength.
(iii) If all x − y paths in H(e

Proof. (i) Let Ge be a fuzzy soft graph. Let P be a strong x − y path in H(ee i)
containing only α−strong arcs. If possible, suppose that P is not a strongest
x − y path. Let Q be a strongest x − y path in H(ee i ). Then P U Q will contain
at least one cycle C in which every arc of C − P will have strength greater than
strength of P . Thus, a weakest arc of C is an arc of P and let uv be such an arc
of C. Let C ′ be the u − v path in C, not containing the arc uv. Then,
e i )(uv) ≤ strength of C ′ ≤ CON N e
K(e H(ei )−uv (uv)

which implies that uv is not α−strong, a contradiction. Thus, P is a strongest

x − y path.
e be a fuzzy soft graph. Let P be the unique strong x − y path in
(ii) Let G
e i ). If possible, suppose that P is not a strongest x − y path. Let Q be a
H(e
e i ). Then, strength of Q > strength of P. i.e., for
strongest x − y path in H(e
e e i )(x′ y ′ ) where x′ y ′ is a weakest arc of P .
every arc uv in Q, K(ei )(uv) > K(e

Claim. Q is a strong x − y path. For; otherwise, if there exists an arc uv in Q

which is a δ−arc, then
e i )(uv) < CON N e
K(e H(ei )−uv (uv) ≤ CON NH(e
e i ) (uv)

e i )(uv) < CON N e (uv).

and hence, K(e H(ei )

e i ) whose strength is greater than

Then there exists a path from u to v in H(e
e i )(uv). Let it be P . Let w be the last node after u, common to Q and P ′ in
K(e ′

the u − w sub path of P ′ and w′ be the first node before v, common to Q and P ′
in the w′ − v sub path of P ′ . (If P ′ and Q are disjoint u − v paths then w = u
and w′ = v). Then the path P ′′ consisting of the x − w path of Q, w − w′ path
e i ) such that strength of P ′′ >
of P ′ , and w′ − y path of Q is x − y path in H(e
strength of Q, contradiction to the assumption that Q is a strongest x − y path
e i ). Thus, uv cannot be a δ − arc and hence, Q is a strong x − y path in
in H(e
e
H(ei ).
Thus, we have another strong path from x to y, other than P , which is a
e i ).
contradiction to the assumption that P is the unique strong x − y path in H(e
Hence, P should be a strongest x − y path in G.
(iii) If every path from x to y have the same strength, then each such path
is strongest x − y path. In particular, a strong x − y path is a strongest x − y
path.
Fuzzy Soft Trees 169

Theorem 3.28. Let G e be a fuzzy soft graph. Then an arc xy in H(e e i ), for some
e
ei ∈ A, of G is a fuzzy soft bridge if and only if it is α−strong.
e be a fuzzy soft graph. Let xy be a fuzzy bridge in H(e
Proof. Let G e i ) of G.
e
Then xy is a fuzzy soft bridge. Then by definition of fuzzy soft bridge,

e i )−xy (xy) < CON NH(e

CON NH(e e i ) (xy) (1)

By Theorem ,
CON NH(e e
e i ) (uv) = K(ei )(uv) (2)
From (1) and (2),
e i )(uv) > CON N e
K(e H(ei )−uv (uv)

which shows that xy is α− strong arc.

Conversely, suppose that xy is α−strong. Then by definition, it follows that
xy is the unique strongest path from x to y and the removal of xy will reduce
the strength of connectedness between x and y. Thus, xy is a fuzzy soft bridge.

e i ), for some ei ∈ A, of fuzzy soft graph G

Corollary 3.29. An arc xy in H(e e is
e i ).
α−strong if and only if xy is in every maximum spanning tree of H(e

We state the following theorems without proofs.

Theorem 3.30. An arc xy in H(e e i ), for some ei ∈ A, of a fuzzy soft tree G

e is
e i ) of H(e
α−strong if and only if xy is an arc of the fuzzy spanning tree Q(e e i ).

Theorem 3.31. Ge is a fuzzy soft tree if and only if there exists a unique α−strong
path between any two nodes in H(ee i ), for some ei ∈ A.

Theorem 3.32. Let Ge be a fuzzy soft graph such that He ∗ (ei ), for some ei ∈ A, is
e e
a cycle. Then G is a fuzzy cycle if and only if H(ei ) has at least two β−strong
arcs.

Theorem 3.33. Let G e be a fuzzy soft graph such that H

e ∗ (ei ), for some ei ∈ A,
e
is a cycle. If H(ei ) contains atmost one α−strong arc, then G e has no fuzzy soft
cutnodes.

Acknowledgement. The authors are thankful to the referees for their valuable comments.

References
[1] M. Akram, Bipolar fuzzy graphs, Information Sciences 181 (2011) 5548–5564.
170 M. Akram and F. Zafar

[2] M. Akram and B. Davvaz, Strong intuitionistic fuzzy graphs, Filomat 26 (2012)
177–196.
[3] M. Akram, A. Farooq, A.B. Saeid, K.P. Shum, Certain types of vague cyclic and
vague trees, Journal of Intell. Fuzzy Systems 28 (2) (2015) 621–631.
[4] M. Akram and W.A. Dudek, Intuitionistic fuzzy hypergraphs with applications,
Information Sciences 218 (2013) 182–193.
[5] M. Akram and S. Nawaz, On fuzzy soft graphs, Italian Journal of Pure and
Applied Mathematics 34 (2015) 97–113.
[6] M. Akram, W. Chen, K.P. Shum, Some properties of vague graphs, Southeast
Asian Bull. Math. 37 (3) (2013) 307–324.
[7] M. Akram and N.O. Al-Shehrie, Intuitionistic fuzzy cycles and intuitionistic fuzzy
trees, The Scientific World Journal (2014), Article ID 305836, 11 pages.
[8] M. Akram and K.P. Shum, Intuitionistic fuzzy Lie algebras, Southeast Asian Bull.
Math. 31 (5) (2007) 843–855.
[9] M. Akram and F. Zafar, On soft trees, Buletinul Acad. Stiinte a Republicia
Moldova 2 (78) (2015) 82–95.
[10] M. Akram and F. Zafar, On fuzzy soft trees, Southeast Asian Bull. Math. 31 (3)
(2007) 843–855.
[11] M.I. Ali, A note on soft sets, rough soft sets and fuzzy soft sets, Applied Soft
Computing 11 (2011) 3329–3332.
[12] P. Bhattacharya, Some remarks on fuzzy graphs, Pattern Recognition Letter 6
(1987) 297–302.
[13] K.R. Bhutani and A. Battou, On M -strong fuzzy graphs, Information Sciences
155 (1) (2003) 103–109.
[14] K.R. Bhutani and A. Rosenfeld, Strong arcs in fuzzy graphs, Information Sciences
152 (2003) 319–322.
[15] F. Feng, M. Akram, B. Davvaz, V.L. Fotea, A new approach to attribute analysis
of information systems based on soft implications, Knowledge-Based Systems 70
(2014) 281–292.
[16] F. Feng, Y.B. Jun, X.Y. Liu, L.F. Li, An adjustable approach to fuzzy soft set
based decision making, J. Comput and Appl. Math. 23 (4) (2010) 10–20.
[17] F. Feng, C.X. Li, B. Davvaz, M. Irfan Ali, Soft sets combined with fuzzy sets and
rough sets: a tentative approach, Soft Computing 14 (2010) 899–911.
[18] A. Kauffman, Introduction a la Theorie des Sous-emsembles Flous, Vol. 1, Masson
et Cie, 1973.
[19] P.K. Maji, A.R. Roy, R. Biswas, Fuzzy soft sets, Journal of Fuzzy Mathematics 9
(3) (2001) 589–602.
[20] S. Mathew and M.S. Sunitha, Types of arcs in a fuzzy graph, Information Sciences
179 (11) (2009) 1760–1768.
[21] D.A. Molodtsov, Soft set theory-first results, Comput. and Math. with Appl. 37
(1999) 19–31.
[22] J.N. Mordeson and P.S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs, 2nd Ed.,
Physica Verlag, Heidelberg, 2001.
[23] A. Rosenfeld, Fuzzy graphs, In: Fuzzy Sets and Their Applications, L.A. Zadeh,
K.S. Fu and M. Shimura (Eds.), Academic Press, New York, 1975.
[24] A.R. Roy, P.K. Maji, A fuzzy soft set theoretic approach to decision making
problems, J. Comput. and Appl. Math. 28 (3) (2007) 412–418.
[25] M.S. Sunitha and A. Vijayakumar, Characterization of fuzzy trees, Information
Sciences 113 (3-4) (1999) 293–300.
[26] L.A. Zadeh, Fuzzy sets, Information and Control 8 (1965) 338–353.
[27] L.A. Zadeh, Similarity relations and fuzzy orderings, Information Sciences 3 (2)
(1971) 177–200.