See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/315381663

Certain Types of Fuzzy Soft Graphs

Article in New Mathematics and Natural Computation · July 2018

DOI: 10.1142/S1793005718500102

CITATIONS READS

6 1,035

2 authors:

Anas Al-Masarwah Majdoleen Abu Qamar

Ajloun National University Universiti Kebangsaan Malaysia
22 PUBLICATIONS 271 CITATIONS 15 PUBLICATIONS 207 CITATIONS

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Neutrosophic fuzzy sets, goal programming, fuzzy goal programming View project

All content following this page was uploaded by Anas Al-Masarwah on 29 June 2018.

The user has requested enhancement of the downloaded file.

New Mathematics and Natural Computation
Vol. 14, No. 2 (2018) 145–156
.c World Scienti¯c Publishing Company
#
DOI: 10.1142/S1793005718500102

Certain Types of Fuzzy Soft Graphs

Anas Al-Masarwah* and Majdoleen Abu Qamar†

Department of Mathematics, Yarmouk University, Irbid, Jordan
*[email protected]
†
[email protected]

In this paper, we introduce the concepts of uniform vertex fuzzy soft graphs, uniform edge fuzzy
soft graphs, degree of a vertex, total degree of a vertex and complement fuzzy soft graphs with
some examples. Also, we study regular and totally regular fuzzy soft graphs, and the conditions
under which the complement of regular fuzzy soft graph becomes regular as well as totally
regular are discussed. Also, we obtain some results related to regular, totally regular and
complete fuzzy soft graphs.

Keywords: Fuzzy soft graph; uniform vertex fuzzy soft graph; uniform edge fuzzy soft graph;
degree of a vertex; total degree of a vertex; complement fuzzy soft graph; regular fuzzy soft
graph; totally regular fuzzy soft graph.

2010 Mathematics Subject Classi¯cation: Primary 05C72, 05C99

1. Introduction
In 1999, Molodtsov10 introduced the concept of soft set theory to solve imprecise
problems in the ¯eld of engineering, social science, economics, medical science and
environment. Molodtsov10,11 applied this theory to several directions such as
smoothness of function, game theory, operation research, probability theory and
measurement theory. In recent times, the research on soft set has been very active
from the researches worldwide. In 2001, Maji, Roy and Biswas7,8 initiated the concept
of fuzzy soft sets which is a combination of fuzzy set and soft set. In 1975, fuzzy graph
theory was introduced by Aziel Rosenfeld.13 In 1994, Moderson introduced the
concept of complement of fuzzy graphs, and in 2002, Sunitha and Vijayakumar14
gave a modi¯ed de¯nition of complement of fuzzy graph.
In 2015, Mohinta and Samanta9 introduced the notions of fuzzy soft graphs, union,
intersection of two fuzzy soft graphs with a few properties related to ¯nite union and
intersection of fuzzy soft graphs. Akram and Nawaz2 introduced the notions of fuzzy
soft graphs, strong fuzzy soft graphs, complete fuzzy soft graphs, regular fuzzy soft
graphs and investigated some of their properties. Akram and Nawaz3 introduced the
*Corresponding author.

145
146 A. Al-Masarwah & M. Abu Qamar

concepts of soft graphs, vertex-induced soft graphs, edge-induced soft graphs and
described some operations on soft graphs. Akram and Zafar4 introduced the notions
of soft trees, soft cycles, soft bridges, soft cutnodes, and described various methods of
construction of soft trees.
In 2016, Akram and Nawaz1 presented the concepts of fuzzy soft graphs, certain
types of irregular fuzzy soft graphs and described applications of fuzzy soft graphs in
social network and road network. Akram and Zafar4 introduced the notions of fuzzy
soft cycles, fuzzy soft bridge, fuzzy soft cutnode, fuzzy soft trees, and investigated
some of their fundamental properties. They also studied some types of arcs in fuzzy
soft graphs. Al-Masarwah and Abu Qamar5 introduced some new concepts of fuzzy
soft graphs, complement fuzzy soft graphs,
-complement fuzzy soft graphs and some
properties of
-complement fuzzy soft graphs. Also, they provided some results about
strong fuzzy soft graphs, complete fuzzy soft graphs and isolated fuzzy soft graphs
with their complements.
In this paper, we introduce the concepts of uniform vertex fuzzy soft graph and
uniform edge fuzzy soft graph. Further we de¯ne the degree of a vertex in fuzzy soft
graphs, total degree of a vertex in fuzzy soft graphs and the complement fuzzy soft
graphs. Also, we study the conditions under which the complement of regular fuzzy
soft graph becomes regular as well as totally regular are discussed. Finally, we obtain
some results related to regular, totally regular and complete fuzzy soft graphs.

2. Preliminaries
De¯nition 2.1 (Ref. 10). A pair < ¼ ð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 <. In other words, a soft set over U is a
parametrized family of subsets of U. For any  2 A; F ðÞ may be considered as set of
-approximate elements of soft set ðF ; AÞ.
Maji, Roy and Biswas8 de¯ned the fuzzy soft set in the following way.
De¯nition 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 ðF~; AÞ is called fuzzy soft set,
where F~ : A ! P ðUÞ is a mapping, called fuzzy approximate function of the fuzzy
soft set ðF~; AÞ.

De¯nition 2.3 (Ref. 15). Let ðF~ 1 ; AÞ and ðF~2 ; BÞ be two fuzzy soft sets over a
common universal set U. Then a relation R of ðF~1 ; AÞ to ðF~2 ; BÞ can be de¯ned as a
fuzzy approximate function R : A  B ! P ðU 2 Þ such that ei 2 A; ej 2 B and for all
up 2 F1 ðei Þ; uq 2 F2 ðej Þ, the relation R is characterized by the following membership
function:
vR ðu1 ; uk Þ ¼
F1 ðei Þ ðu1 Þ 
F2 ðej Þ ðuk Þ;

where u1 2 F1 ðei Þ; uk 2 F2 ðej Þ.

 Certain Types of Fuzzy Soft Graphs 147

De¯nition 2.4 (Ref. 13). Let V be a nonempty ¯nite set and  : V ! ½0; 1. Again,
let
: V  V ! ½0; 1 such that

ðx; yÞ  ðxÞ ^ ðyÞ 8ðx; yÞ 2 V  V :

Then the pair G ¼ ð;
Þ is called a fuzzy graph over the set V . Here  and
are
respectively called fuzzy vertex and fuzzy edge of the fuzzy graph G ¼ ð;
Þ.
De¯nition 2.5 (Ref. 13). The underlying crisp graph of a fuzzy graph G ¼ ð;
Þ
is denoted by G ¼ ð  ;
 Þ, where   ¼ fu 2 V : ðuÞ > 0g and
 ¼ fðu; vÞ 2
V  V :
ðu; vÞ > 0g.
De¯nition 2.6 (Ref. 12). Let G ¼ ð;
Þ be a fuzzy graph. The degree of a vertex
u is de¯ned as
X
degðuÞ ¼
ðu; vÞ:
v2V ;v6¼u

De¯nition 2.7 (Ref. 12). Let G ¼ ð;
Þ be a fuzzy graph. The total degree of a
vertex u is de¯ned as
X
tdegðuÞ ¼
ðu; vÞ þ ðuÞ ¼ degðuÞ þ ðuÞ:
v2V ;v6¼u

De¯nition 2.8 (Ref. 14). Let G ¼ ð;
Þ be a fuzzy graph. The complement of G is
de¯ned as G ¼ ð;
Þ, where
ðx; yÞ ¼ ðxÞ ^ ðyÞ 
ðx; yÞ 8x; y 2 V .
When G is a fuzzy graph, G ¼ ð;
Þ is also a fuzzy graph.

De¯nition 2.9 (Ref. 6). Let G ¼ ð;
Þ be a fuzzy graph on G  ¼ ðV ; EÞ.

Let   ¼ fx 2 V : ðxÞ > 0g. Then G is said to be a uniform vertex fuzzy graph if
ðxÞ ¼ k 8x 2   where k is some positive real such that 0 < k  1.
De¯nition 2.10 (Ref. 6). Let G ¼ ð;
Þ be a fuzzy graph on G  ¼ ðV ; EÞ.
Let   ¼ fx 2 V : ðxÞ > 0g. Then G is said to be a uniform edge fuzzy graph if

ðx; yÞ ¼ k 8ðx; yÞ 2      with x 6¼ y where k is some positive real such that
0 < k  1.
~ ¼ ðG  ; F~; K~ ; AÞ is a 4-tuple
De¯nition 2.11 (Ref. 2). A fuzzy soft graph G
such that:
1. G  ¼ ðV ; EÞ is a simple graph,
2. A is a nonempty set of parameters,
3. ðF~; AÞ is a fuzzy soft set over V ,
4. ðK~ ; AÞ is a fuzzy soft set over E,
5. ðF~ðaÞ; K~ ðaÞÞ is a fuzzy (sub)graph of G  for all a 2 A. That is,
K~ ðaÞðx; yÞ  minfF~ ðaÞðxÞ; F~ðaÞðyÞg
148 A. Al-Masarwah & M. Abu Qamar

for all a 2 A and x; y 2 V . The fuzzy graph ðF~ ðaÞ; K~ ðaÞÞ is denoted by H
~ ðaÞ for con-
venience. On the other hand, a fuzzy soft graph is a parameterized family of fuzzy graphs.
~ is
De¯nition 2.12 (Ref. 9). The underlying crisp graph of a fuzzy soft graph G
denoted by G  ¼ ðF~ ; K~ Þ where
 

F~ ¼ fa 2 V : F~ ðei ÞðaÞ > 0 for some ei 2 Ag,



K~ ¼ fða; bÞ 2 V  V : K~ ðei Þða; bÞ > 0 for some ei 2 Ag.



~ be a fuzzy soft graph. The order of G

De¯nition 2.13 (Ref. 2). Let G ~ is de¯ned as
!
X X
~
OðGÞ ¼ ~
F ðei ÞðaÞ :
ei 2A a2V

~ be a fuzzy soft graph. The size of G

De¯nition 2.14 (Ref. 2). Let G ~ is de¯ned as
!
X X
~ ¼
SðGÞ ~ i ÞðabÞ :
kðe
ei 2A ab2E

~ is a strong fuzzy soft graph if H

De¯nition 2.15 (Ref. 2). A fuzzy soft graph G ~ ðeÞ
is a strong fuzzy graph for all e 2 A, i.e.
K~ ðeÞða; bÞ ¼ minfF~ðeÞðaÞ; F~ðeÞðbÞg
for all ða; bÞ 2 E.
A fuzzy soft graph G~ is a complete fuzzy soft graph if H
~ ðeÞ is a complete fuzzy
graph for all e 2 A. That is,
K~ ðeÞða; bÞ ¼ minfF~ðeÞðaÞ; F~ðeÞðbÞg
for all a; b 2 V .

De¯nition 2.16 (Ref. 2). Let G  ¼ ðV ; EÞ be a crisp graph and G ~ be a fuzzy soft
 ~ ~
graph of G . Then G is said to be a regular fuzzy soft graph if H ðeÞ is a regular fuzzy
~
~ ðeÞ is a regular fuzzy graph of degree r for all e 2 A, then G
graph for all e 2 A. If H
is a r-regular fuzzy soft graph.

De¯nition 2.17 (Ref. 2). Let G  ¼ ðV ; EÞ be a simple graph and G ~ be a fuzzy soft
 ~ ~ ðeÞ is a totally
graph of G . Then G is said to be a totally regular fuzzy soft graph if H
~
regular fuzzy graph for all e 2 A. If H ðeÞ is a totally regular fuzzy graph of total
~ is called r-totally regular fuzzy soft graph.
degree r for all e 2 A, then G

3. Uniform Vertex and Uniform Edge Fuzzy Soft Graphs

~ is
We assume that the underling crisp graph G  ¼ ðV ; EÞ of any fuzzy soft graph G
¯nite and simple.
 Certain Types of Fuzzy Soft Graphs 149

~ be a fuzzy soft graph of G  .

De¯nition 3.1. Let G  ¼ ðV ; EÞ be a crisp graph and G
Then G~ is said to be a uniform vertex fuzzy soft graph if H
~ ðeÞ is a uniform vertex
fuzzy graph for all e 2 A.

Example 3.1. Consider a crisp graph G  ¼ ðV ; EÞ such that V ¼ fx1 ; x2 ; x3 ; x4 g

and E ¼ fx1 x2 ; x2 x3 ; x3 x4 ; x4 x1 g. Let A ¼ fe1 ; e2 ; e3 g be a parameter set and
let ðF~; AÞ be a fuzzy soft set over V with its approximate function F~ : A ! P ðV Þ
given by
F~ ðe1 Þ ¼ fx1 j0:6; x2 j0:6; x3 j0:6; x4 j0:6g;
F~ ðe2 Þ ¼ fx1 j0:3; x2 j0:3; x3 j0:3; x4 j0:3g;
F~ ðe3 Þ ¼ fx1 j0:4; x2 j0:4; x3 j0:4; x4 j0:4g:

Let ðK~ ; AÞ be a fuzzy soft set over E with its approximate function K~ : A ! P ðEÞ
given by
K~ ðe1 Þ ¼ fx1 x2 j0:2; x2 x3 j0:5; x3 x4 j0:3; x4 x1 j0:4g;
K~ ðe2 Þ ¼ fx1 x2 j0:2; x2 x3 j0:3; x3 x4 j0:2; x4 x1 j0:3g;
K~ ðe3 Þ ¼ fx1 x2 j0:3; x2 x3 j0:4; x3 x4 j0:2; x4 x1 j0:3g:
By routine computations, it easy to see that fuzzy graphs
~ ðe1 Þ ¼ ðF~ ðe1 Þ; F~ðe1 ÞÞ;
H
~ ðe2 Þ ¼ ðF~ ðe2 Þ; F~ðe2 ÞÞ;
H
~ ðe3 Þ ¼ ðF~ ðe3 Þ; F~ðe3 ÞÞ
H
are uniform vertex fuzzy graphs.
~ ¼ ðH
Hence, G ~ ðe1 Þ; H
~ ðe2 Þ; H
~ ðe3 ÞÞ is a uniform vertex fuzzy soft graph of G  .

Fig. 1. Uniform vertex fuzzy soft graph.

De¯nition 3.2. Let G  ¼ ðV ; EÞ be a crisp graph and G ~ be a fuzzy soft graph of G  .

Then G~ is said to be a uniform edge fuzzy soft graph if H
~ ðeÞ is a uniform edge fuzzy
graph for all e 2 A.
Example 3.2. Consider a crisp graph G  ¼ ðV ; EÞ such that V ¼ fx1 ; x2 ; x3 ; x4 g
and E ¼ fx1 x2 ; x2 x3 ; x3 x4 ; x4 x1 g. Let A ¼ fe1 ; e2 ; e3 g be a parameter set and
150 A. Al-Masarwah & M. Abu Qamar

let ðF~; AÞ be a fuzzy soft set over V with its approximate function F~ : A ! P ðV Þ
given by
F~ ðe1 Þ ¼ fx1 j0:4; x2 j0:6; x3 j0:7; x4 j0:5g;
F~ ðe2 Þ ¼ fx1 j0:5; x2 j0:7; x3 j0:8; x4 j0:6g;
F~ ðe3 Þ ¼ fx1 j0:6; x2 j0:8; x3 j0:9; x4 j0:7g:
Let ðK~ ; AÞ be a fuzzy soft set over E with its approximate function K~ : A ! P ðEÞ
given by
K~ ðe1 Þ ¼ fx1 x2 j0:4; x2 x3 j0:4; x3 x4 j0:4; x4 x1 j0:4g;
K~ ðe2 Þ ¼ fx1 x2 j0:5; x2 x3 j0:5; x3 x4 j0:5; x4 x1 j0:5g;
K~ ðe3 Þ ¼ fx1 x2 j0:6; x2 x3 j0:6; x3 x4 j0:6; x4 x1 j0:6g:
By routine computations, it easy to see that fuzzy graphs
~ ðe1 Þ ¼ ðF~ ðe1 Þ; F~ðe1 ÞÞ;
H
~ ðe2 Þ ¼ ðF~ ðe2 Þ; F~ðe2 ÞÞ;
H
~ ðe3 Þ ¼ ðF~ ðe3 Þ; F~ðe3 ÞÞ
H
are uniform edge fuzzy graphs.
~ ¼ ðH~ ðe1 Þ; H~ ðe2 Þ; H~ ðe3 ÞÞ is a uniform edge fuzzy soft graph of G  .
Hence, G

Fig. 2. Uniform edge fuzzy soft graph.

~ be a fuzzy soft graph on G  . The degree of a vertex u is

De¯nition 3.3. Let G
de¯ned as
!
X X
deg ~ ðuÞ ¼
G K~ ðei Þðu; vÞ :
ei 2A v2V ;v6¼u

De¯nition 3.4. Let G ~ be a fuzzy soft graph on G  . The total degree of a vertex u is
de¯ned as
!
X X X
tdeg ~ ðuÞ ¼
G K~ ðei Þðu; vÞ þ F~ðei ÞðuÞ:
ei 2A v2V ;v6¼u ei 2A
 Certain Types of Fuzzy Soft Graphs 151

i.e.
X
tdegG~ ðuÞ ¼ degG~ ðuÞ þ F~ðei ÞðuÞ:
ei 2A

De¯nition 3.5. Let G ~ be a fuzzy soft graph on G  . The complement of G ~ is a fuzzy

soft graph G ~ ¼ ðG ; F~; K~ ; AÞ where F~ðei ÞðuÞ ¼ F~ðei ÞðuÞ and K~ ðei Þðu; vÞ ¼


minfF~ ðei ÞðuÞ; F~ðei ÞðvÞg  K~ ðei Þðu; vÞ 8u; v 2 V ; 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.

Example 3.3. Consider a crisp graph G  ¼ ðV ; EÞ such that V ¼ fx1 ; x2 ; x3 ; x4 g

and E ¼ fx1 x2 ; x2 x3 ; x3 x4 ; x4 x1 g. Let A ¼ fe1 ; e2 g be a parameter set and let ðF~ ; AÞ
be a fuzzy soft set over V with its approximate function F~ : A ! P ðV Þ given by
F~ ðe1 Þ ¼ fx1 j0:5; x2 j0:3; x3 j0:2; x4 j0:9g;
F~ ðe2 Þ ¼ fx1 j0:7; x2 j0:5; x3 j0:1; x4 j0:8g:
Let ðK~ ; AÞ be a fuzzy soft set over E with its approximate function K~ : A ! P ðEÞ
given by
K~ ðe1 Þ ¼ fx1 x2 j0:3; x2 x3 j0:2; x3 x4 j0:2; x4 x1 j0:5g;
K~ ðe2 Þ ¼ fx1 x2 j0:5; x2 x3 j0:1; x3 x4 j0:1; x4 x1 j0:7g:
It is easy to see that
~ ðe1 Þ ¼ ðF~ ðe1 Þ; F~ðe1 ÞÞ;
H
~ ðe2 Þ ¼ ðF~ ðe2 Þ; F~ðe2 ÞÞ
H
are fuzzy graphs.
Hence, G~ ¼ ðH
~ ðe1 Þ; H
~ ðe2 ÞÞ is a fuzzy soft graph.

Fig. 3. Fuzzy soft graph.

By routine computations, the degree of a vertex x1 is

!
X X
deg ~ ðx1 Þ ¼
G K~ ðei Þðx1 ; vÞ
ei 2A v2V ;x1 6¼v
X
¼ ðK~ ðei Þðx1 ; x2 Þ þ K~ ðei Þðx1 ; x4 ÞÞ
ei 2A

¼ ð0:3 þ 0:5Þ þ ð0:5 þ 0:7Þ

¼ 0:8 þ 1:2 ¼ 2:
152 A. Al-Masarwah & M. Abu Qamar

The total degree of a vertex x1 is

X
tdegG~ ðx1 Þ ¼ degG~ ðx1 Þ þ F~ðei Þðx1 Þ
e2A
¼ 2 þ ð0:5 þ 0:7Þ ¼ 2 þ 1:2 ¼ 3:2:

~ is shown in Fig. 4.
Also, the complement of a fuzzy soft graph G

Fig. 4. Complement fuzzy soft graph.

Theorem 3.6. Let G  ¼ ðV ; EÞ be a simple graph. If G ~ is a regular fuzzy soft graph


and uniform vertex fuzzy soft graph on G , then the complement fuzzy soft graph G ~ is
also regular.

Proof. Let V be a ¯nite set of vertices. Since V is ¯nite, we have F~ ¼ fx 2 V :



F~ðei ÞðxÞ > 0 for some ei 2 Ag is also ¯nite. Let jF~ j ¼ n.



Given that G ~ is a regular fuzzy soft graph. Then deg ~ ðaÞ ¼ ri in fuzzy graphs
G
H~ ðei Þ 8a 2 F~ for some positive real number ri and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.


Also, given that G ~ is a uniform vertex fuzzy soft graph. Then F~ðei ÞðxÞ ¼ ki in
fuzzy graphs H ~ ðei Þ 8x 2 F~  for some real number ki where 0 < ki  1 and 8ei 2 A
for i ¼ 1; 2; 3; . . . ; n.
P
Let x 2 F~ . deg ~ ðxÞ ¼ x6¼y K~ ðei Þðx; yÞ in fuzzy graphs H
~ ðei Þ 8ei 2 A for

G
i ¼ 1; 2; 3; . . . ; n. Now,
X
deg ~ ðxÞ ¼ ðminfF~ ðei ÞðxÞ; F~ðei ÞðyÞg  K~ ðei Þðx; yÞÞ
G
x6¼y
X X
¼ minfF~ðei ÞðxÞ; F~ ðei ÞðyÞg  K~ ðei Þðx; yÞ
x6¼y x6¼y
X
¼ ki  degG~ ðxÞ ¼ ki ðn  1Þ  ri
x6¼y

~ ðei Þ 8x 2 F~  and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Thus, deg ðxÞ ¼

in fuzzy graphs H ~ G
~ is also regular
ki ðn  1Þ  ri 8x 2 F~ and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Therefore, G


fuzzy soft graph.

 Certain Types of Fuzzy Soft Graphs 153

~ is a totally regular fuzzy soft

Theorem 3.7. Let G  ¼ ðV ; EÞ be a simple graph. If G

graph and uniform vertex fuzzy soft graph on G , then the complement fuzzy soft
~ is also totally regular.
graph G

Proof. Let V be a ¯nite set of vertices. Since V is ¯nite, we have F~ ¼ fx 2 V :



~ ~ 
F ðei ÞðxÞ > 0 for some ei 2 Ag is also ¯nite. Let jF j ¼ n.
Given that G~ is a totally regular fuzzy soft graph. Then tdeg ~ ðaÞ ¼ si in fuzzy graphs
G
H~ ðei Þ 8a 2 F~ for some positive real number si and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.


Also, given that G ~ is a uniform vertex fuzzy soft graph. Then F~ðei ÞðxÞ ¼ ki in
fuzzy graphs H ðei Þ 8x 2 F~ for some real number ki where 0 < ki  1 and 8ei 2 A
~ 

for i ¼ 1; 2; 3; . . . ; n.
P
Let x 2 F~ , tdeg ~ ðxÞ ¼ deg ~ ðxÞ þ F~ ðei ÞðxÞ ¼ x6¼y K~ ðx; yÞ þ F~ ðei ÞðxÞ in fuzzy

G G
~ ðei Þ for all ei 2 A for i ¼ 1; 2; 3; . . . ; n.
graphs H
Now,
X
tdeg ~ ðxÞ ¼ ðminfF~ðei ÞðxÞ; F~ ðei ÞðyÞg  K~ ðei Þðx; yÞÞ þ F~ ðei ÞðxÞ
G
x6¼y
X X
¼ minfF~ðei ÞðxÞ; F~ðei ÞðyÞg  K~ ðei Þðx; yÞ þ F~ðei ÞðxÞ
x6¼y x6¼y
X X
¼ minfF~ðei ÞðxÞ; F~ðei ÞðyÞg  K~ ðei Þðx; yÞ  F~ðei ÞðxÞ
x6¼y x6¼y

þ F~ðei ÞðxÞ þ F~ðei ÞðxÞ

!
X X
¼ minfF~ðei ÞðxÞ; F~ðei ÞðyÞg  K~ ðei Þðx; yÞ þ F~ ðei ÞðxÞ
x6¼y x6¼y

þ2F~ðei ÞðxÞ
X
¼ ki  ðdegG~ ðxÞ þ F~ðei ÞðxÞÞ þ 2F~ðei ÞðxÞ
x6¼y

¼ ki ðn  1Þ  tdegG~ ðxÞ þ 2ki

¼ ki ðn  1Þ  si þ 2ki
¼ ðn þ 1Þki  si
~ ðei Þ 8x 2 F~  and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Thus, tdeg ðxÞ ¼
in fuzzy graphs H ~ G
~ is also totally
ðn þ 1Þki  si 8x 2 F~ and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Therefore, G


regular fuzzy soft graph.

~ is a uniform edge fuzzy soft
Theorem 3.8. Let G  ¼ ðV ; EÞ be a simple graph. If G
 ~
graph on G , then G is regular fuzzy soft graph.

Proof. Let V be a ¯nite set of vertices. Since V is ¯nite, we have F~ ¼ fx 2 V :



F~ðei ÞðxÞ > 0 for some ei 2 Ag is also ¯nite. Let jF~ j ¼ n.


154 A. Al-Masarwah & M. Abu Qamar

Given that G ~ is a uniform edge fuzzy soft graph. Then K~ ðei Þðx; yÞ ¼ ki in fuzzy
~ ðei Þ 8ðx; yÞ 2 F~   F~  with x 6¼ y for some real number ki where 0 < ki  1
graphs H
and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.
P P
Let u 2 F~ . Now, degG~ ðuÞ ¼ u6¼v K~ ðei Þðu; vÞ ¼ x6¼y ki ¼ ðn  1Þki in fuzzy


~ ðei Þ 8u 2 F~  and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Thus, deg ~ ðuÞ ¼ ðn  1Þki 8u

graphs H G
~ is regular fuzzy soft graph.
2 F~ and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Therefore, G


Theorem 3.9. Let G  ¼ ðV ; EÞ be a simple graph. If G ~ is both uniform edge fuzzy soft
 ~
graph and uniform vertex fuzzy soft graph on G , then G is a totally regular fuzzy soft graph.

Proof. Let V be a ¯nite set of vertices. Since V is ¯nite, we have F~ ¼ fx 2 V :



F~ðei ÞðxÞ > 0 for some ei 2 Ag is also ¯nite. Let jF~ j ¼ n.



Given that G ~ is a uniform edge fuzzy soft graph. Then K~ ðei Þðx; yÞ ¼ ki in fuzzy
graphs H ðei Þ 8ðx; yÞ 2 F~  F~ with x 6¼ y for some real number ki where 0 < ki  1
~  

and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.

Also, given that G ~ is a uniform vertex fuzzy soft graph. Then F~ ðei ÞðxÞ ¼ si in
fuzzy graphs H ~ ðei Þ 8x 2 F~  for some real number si where 0 < si  1 and 8ei 2 A for
i ¼ 1; 2; 3; . . . ; n.
P
Let u 2 F~ . Now, tdegG~ ðuÞ ¼ degG~ ðuÞ þ F~ ðei ÞðuÞ ¼ u6¼v K~ ðu; vÞ þ F~ ðei ÞðuÞ ¼

P
~
x6¼y ki þ si ¼ ðn  1Þki þ si in fuzzy graphs H ðei Þ 8u 2 F
~  and 8ei 2 A for
tdegG~ ðuÞ ¼ ðn  1Þki þ si 8u 2 F~

i ¼ 1; 2; 3; . . . ; n. Thus, and 8ei 2 A for
~
i ¼ 1; 2; 3; . . . ; n. Therefore, G is totally regular fuzzy soft graph.

Theorem 3.10. Let G  ¼ ðV ; EÞ be a simple graph. If G ~ is a complete fuzzy soft

 ~
graph and uniform vertex fuzzy soft graph on G , then G is regular fuzzy soft graph.

Proof. Let V be a ¯nite set of vertices. Since V is ¯nite, we have F~ ¼ fx 2 V :



F~ðei ÞðxÞ > 0 for some ei 2 Ag is also ¯nite. Let jF~ j ¼ n.



Given that G ~ is a complete fuzzy soft graph. Then K~ ðei Þðu; vÞ ¼ minfF~ðei ÞðuÞ;
F~ðei ÞðvÞg in fuzzy graphs H ~ ðei Þ 8u; v 2 F~  and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.
Also, given that G ~ is a uniform vertex fuzzy soft graph. Then F~ðei ÞðxÞ ¼ ki in
fuzzy graphs H ðei Þ 8x 2 F~ for some real number ki where 0 < ki  1 and 8ei 2 A
~ 

for i ¼ 1; 2; 3; . . . ; n.
Let u 2 F~ . Now,

X
degG~ ðuÞ ¼ K~ ðei Þðu; vÞ
u6¼v
X
¼ minfF~ðei ÞðuÞ; F~ðei ÞðvÞg
u6¼v
X
¼ ki ¼ ðn  1Þki
x6¼y
 Certain Types of Fuzzy Soft Graphs 155

in fuzzy graphs H~ ðei Þ 8u 2 F~  and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Thus, deg ~ ðuÞ ¼

G
~ is regular fuzzy soft
ðn  1Þki 8u 2 F~ and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Therefore, G


graph.

Theorem 3.11. Let G  ¼ ðV ; EÞ be a simple graph. If G~ is a complete fuzzy soft graph

 ~
and uniform vertex fuzzy soft graph on G , then G is totally regular fuzzy soft graph.

Proof. Let V be a ¯nite set of vertices. Since V is ¯nite, we have F~ ¼ fx 2 V :



F~ðei ÞðxÞ > 0 for some ei 2 Ag is also ¯nite. Let jF~ j ¼ n.



Given that G ~ is a complete fuzzy soft graph. Then K~ ðei Þðu; vÞ ¼ minfF~ðei ÞðuÞ;
F~ðei ÞðvÞg in fuzzy graphs H ~ ðei Þ 8u; v 2 F~  and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.
Also, given that G ~ is a uniform vertex fuzzy soft graph. Then F~ðei ÞðxÞ ¼ ki in
fuzzy graphs H ðei Þ 8x 2 F~ for some real number ki where 0 < ki  1 and 8ei 2 A
~ 

for i ¼ 1; 2; 3; . . . ; n.
P
Let u 2 F~ . tdegG~ ðuÞ ¼ degG~ ðuÞ þ F~ðei ÞðuÞ ¼ u6¼v K~ ðei Þðu; vÞ þ F~ðei ÞðuÞ in


fuzzy graphs H ~ ðei Þ 8u 2 F~  and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.

Now,
X
tdegG~ ðuÞ ¼ minfF~ðei ÞðuÞ; F~ðei ÞðvÞg þ F~ ðei ÞðuÞ
u6¼v
X
¼ ki þ ki
u6¼v

¼ ðn  1Þki þ ki
¼ nki
~ ðei Þ 8u 2 F~ and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Thus, tdeg ~ ðuÞ ¼
in fuzzy graphs H

G
~ is totally regular fuzzy soft graph.
nki 8u 2 F~ for i ¼ 1; 2; 3; . . . ; n. Therefore, G


Theorem 3.12. Let G  ¼ ðV ; EÞ be a simple graph. If G~ is a regular fuzzy soft graph

 ~
and uniform vertex fuzzy soft graph on G , then G is totally regular fuzzy soft graph.

Proof. Let V be a ¯nite set of vertices. Since V is ¯nite, we have F~ ¼ fx 2 V :



F~ðei ÞðxÞ > 0 for some ei 2 Ag is also ¯nite. Let jF~ j ¼ n.



Given that G ~ is a regular fuzzy soft graph. Then deg ~ ðuÞ ¼ ri in fuzzy graphs
G
H~ ðei Þ 8u 2 F~  for a positive real number ri and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.
Also, given that G ~ is a uniform vertex fuzzy soft graph. Then F~ðei ÞðxÞ ¼ ki in
fuzzy graphs H ~ ðei Þ 8x 2 F~  for some real number ki where 0 < ki  1 and 8ei 2 A
for i ¼ 1; 2; 3; . . . ; n.
Let u 2 F~ . Now, tdegG~ ðuÞ ¼ degG~ ðuÞ þ F~ðei ÞðuÞ in fuzzy graphs H ~ ðei Þ 8u 2 F~ 


and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n.

Thus, tdegG~ ðuÞ ¼ ri þ ki 8u 2 F~ and 8ei 2 A for i ¼ 1; 2; 3; . . . ; n. Therefore, G
 ~
is totally regular fuzzy soft graph.
 156 A. Al-Masarwah & M. Abu Qamar

4. Conclusion
In this paper, we introduced the concepts of uniform vertex and uniform edge fuzzy
soft graphs with illustrative examples. Also we produced various results related to
these concepts. And ¯nally we obtained some results related to regular, totally reg-
ular and complete fuzzy soft graphs.

References
1. M. Akram and S. Nawaz, Fuzzy soft graphs with applications, Journal of Intelligent and
Fuzzy Systems 30(6) (2016) 3619–3632.
2. M. Akram and S. Nawaz, On fuzzy soft graphs, Italian Journal of Pure and Applied
Mathematics 34 (2015) 497–514.
3. M. Akram and S. Nawaz, Operations on soft graphs, Fuzzy Information and Engineering
7(4) (2015) 423–449.
4. M. Akram and F. Zafar, On soft trees, Buletinul Academiei de Stiinte a Republicii Mol-
dova 2(78) (2015) 82–95.
5. A. Al-Masarwah and M. Abu Qamar, Some new concepts of fuzzy soft graphs, Fuzzy
Information and Engineering 8(4) (2016) 427–438.
6. Ch. Chaitanya and T. V. Kumar, A note on uniform vertex and uniform edge fuzzy
graphs, International Journal of Innovative Research in Science, Engineering and
Technology 4(7) (2015).
7. P. K. Maji, A. R. Roy and R. Biswas, An application of soft sets a decision making
problem, Computers and Mathematics with Applications 44(8–9) (2002) 1077–1083.
8. P. K. Maji, A. R. Roy and R. Biswas, Fuzzy soft sets, The Journal of Fuzzy Mathematics
9(3) (2001) 589–602.
9. S. Mohinta and T. K. Samant, An introduction to fuzzy soft graph, Mathematica Mor-
avica 19(2) (2015) 35–48.
10. D. A. Molodtsov, Soft set theory-¯rst results, Computers and Mathematics with Appli-
cations 37 (1999) 19–31.
11. D. A. Molodtsov, The Theory of Soft Sets (in Russian) (URSS Publishers, Moscow, 2004).
12. A. Nagoorgani and K. Radah, On regular fuzzy graph, Journal of Physical Sciences 12
(2008) 33–40.
13. A. Rosenfeld, Fuzzy graphs, in Fuzzy Sets and Their Applications to Cognitive and
Decision Process (eds.) L. A. Zadeh, K. S. Fu, K. Tanaka and M. Shimura (Academic
Press, New York, 1975), pp. 75–95.
14. M. S. Sunitha and A. Vijayakumar, Complement of fuzzy graph, Indian Journal of Pure
and Applied Mathematics 33(9) (2002) 1451–1464.
15. D. K. Sut, An application of fuzzy soft relation in decision making problems, International
Journal of Mathematics Trends and Technology 3(2) (2012) 50–53.

View publication stats