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

net/publication/312092976

FUZZY DUAL GRAPH

Article · January 2010

CITATIONS READS

23 2,645

3 authors, including:

Eman Hassan Ouda

University of Technology, Iraq
23 PUBLICATIONS   87 CITATIONS   

SEE PROFILE

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

Mental health View project

Membership certificates View project

All content following this page was uploaded by Eman Hassan Ouda on 06 January 2017.

The user has requested enhancement of the downloaded file.

Journal of Al-Nahrain University Vol.12 (4), December, 2009, pp.168-171 Science

FUZZY DUAL GRAPH

*Nuha abdul-jabbar, Jehan H. Naoom and, Eman H. Ouda

Department of Applied Sciences, University of Technology.
*E-mail :Nuha1900@yahoo.com.

Abstract
The definition of fuzzy dual graphs are considered with the following properties are obtained,
which are the dual of the dual of fuzzy graph is the fuzzy graph itself, and the dual of fuzzy bipartite
graph is Eulerian fuzzy graph.
Key word: fuzzy graph, dual graph, euler graph.

Introduction Definition (1) [6, p.16]

Researches on the theory of fuzzy sets has Suppose that the vertex set of a graph G
been witnessing an exponential growth both can be split into two disjoint sets V1 and V2, in
within mathematics and in its applications, this such a way that every edge of G joins a vertex
ranges from traditional mathematical subjects of V1 to a vertex in V2: G is then said to be a
like logic, topology, algebra, analysis, etc. to bipartite graph, which we denoted by
pattern recognition, information theory, G(V1,V2) as shown in Fig. (1).
artificial intelligence, operation research,
neural networks and planning, etc. V1
Consequently fuzzy set theory has emerged as
a potential area of interdisciplinary research
and fuzzy graph theory is of recent interest
[5,7].
Rosenfeld in 1975 considered fuzzy
V2
relations on fuzzy sets and developed the
theory of fuzzy graphs, and then some basic Fig. (1) : Bibartite
fuzzy graph theoretic concepts and graph.
applications have been indicated, many
authors found deeper results, and fuzzy
analogues of many other graph theoretic Definition (2) [6, p.30]
concepts, this include fuzzy trees, fuzzy line A connected graph G is called an Eulerian
graphs, operations on fuzzy graphs, graph if there exists a circuit which includes
automorphism of fuzzy graph, fuzzy interval every edge of G; such a circuit is called an
graphs, cycles and cocycles of fuzzy graphs, Eulerian circuit, (See Fig. (2)).
bipartite fuzzy graph and metric aspects in
fuzzy graph [3,4,5].
In this paper the definition of dual fuzzy
graph is modified and we get some properties
of it. Which are the dual of dual fuzzy graph is
the fuzzy graph itself, and the dual of bipartite
fuzzy graph is an Eulerian fuzzy graph.
Basic Concept Fig. (2) : Eulerian graph.
In this section we explain some basic
definitions of the graph G with n vertices and Theorem(1) [2,p.86], [6,p.32]
m edges consisting of a vertex set A given connected graph G is an Eulerian
V(G)  v1 ,..., v n  and an edge set Graph if and only if all vertices of G are of
E(G)  e1 ,..., e n  where each edge consists of even degree.
two vertices called its endpoints.

168
 Nuha abdul-jabbar

Definition (3) [2, p.247], [6,p.64] Lemma [6, p.73]

A planar graph is a graph drawn in the Let G be a planar connected graph with n
plane in such a way that no two edges intersect vertices, m edges and f faces, and let its
geometrically except at a vertex to which they geometric dual G* have n* vertices, m* edges
are both incident, each closed region in a and f* faces. Then n*=f, m*=m, and f*=n.
planar graph called face. Theorem (2) [6, p.74]
An example of a planar graph is given in Let G be a planar connected graph. Then
Fig. (3). G** is isomorphic to G.
Theorem (3) [2, p.235]
Edges in a planar graph G form a cycle in
G if and only if corresponding dual edges form
a bond (cut edge) in G*.
G G
Definition (5)[1]
1 2
Planar graph is said to be dual Eulerian if it
Fig. (3) : Planar graphs.
has an Eulerian circuit e1,…,ek such that
e1*,…,ek* form an Eulerian circuit in G*.

Corollary [6, p.67] Fuzzy Dual Graph

If G is a connected simple planar graphs Let G(V,E,F) be a graph with V the set of
with n(≥3) vertices and m edges, then vertices, E the set of edges, and F the set of
m ≤ (3n-6). faces .
A fuzzy subsets of a set F is a mapping
Remark [2, p.256] λ:F  [0,1] for any f  F , λ(F) is called the
A simple planar graph G with (3n-6) edges, ~
degree of membership of f in G (the fuzzy
and every face is a triangle called a maximal
graph), a fuzzy subset of a set V is a mapping
planar graph.
 :V  [0,1] for any v  V , (v) is called
Definition (4) [2, p.250] ~
Suppose G is a planar graph. The dual the degree of membership of V in G . If λ and
graph G* of G is a planar graph having a  is into [0,1] then they are called the
vertex for each face in G. The edges of G* characteristic functions of a subset F and V
correspond to the edge of G as follow: if e is respectively , and they are known as “crisp”.
an edge of G that has face Fi on one side and A fuzzy relation on V is a fuzzy subset of
V×V, a fuzzy relation µ on V is a fuzzy
face Fj on the other side, then the
relation on б which is µ (u,v)≤  (u)   (v).
corresponding dual edge e  E(G  ) is an edge For all u, v in V, where  stands for
joining the vertices x, y of G* that minimum.
corresponding to the faces Fi , Fj of G. In this paper we define a fuzzy planar
graph which is defined by the triple functions
Below we have drown a plane graph G ~
with solid edge, and its dual G*with dashed G(, , ) where б is fuzzy subset of V, µ is
edges (see Fig.(4)). symmetric fuzzy relation on б, and λ is a fuzzy
subset of F.
Note that the crisp graph (V, E, F) is a
special case of a fuzzy graph with each
membership equal one.

Fig. (4) :Dual graph

G*.
169
Journal of Al-Nahrain University Vol.12 (4), December, 2009, pp.168-171 Science

0.7 F3 0.3

e1 0.3 0.3
0.9 0.6
0. ee V3 0.
F1 0.3 F2 0.3
3 0.f 3
23 f
V2 4
0. 2 3 0.5 0.3 0.4
Fig.0.(5): Fuzzy
e4 V
planar
0 graph.
3 0.6
6 0. 4.
F40.5
Definition (6) 5 0 0.
V 6
The maximal fuzzy . 5 planar graph is the 0.3
fuzzy planar1 graph with
6 maximum number of
edges such that, when we add any other edge, Fig. (7) : Fuzzy planar graph.
the graph be fuzzy non planar graph.
Note that the maximal fuzzy bipartite
planar graph having even cycles of length four,
see Fig.(6). Proposition (1)
The dual of the dual fuzzy graph is the
~ ** ~
fuzzy graph itself G G

Proof:
By using the definition of fuzzy dual graph
~
the dual of fuzzy graph G having the degree
Fig. (6) : Fuzzy bipartite planar of membership as follow:
graph. ( v*i )  (f i )
(e* )  (e)
Definition (7)
~  (f * )  ( v )
Given a fuzzy planar graph G , we shall
~ and the dual of the dual fuzzy graph has the
construct another fuzzy graph G * called dual
~ degree of membership as follow:
fuzzy graph of G . ( v ** )  (f * )  ( v)
The construction is in three stages:
~
1- Inside each face Fi of G we choose a
~  ( v ** )  ( v)
~ ~ (e ** )  (e * )  (e)
point Vi* these points are the vertices of G *
with the degree of membership  (e ** )  (e)
( v *i )  (f i ) (f ** )  ( v * )  (f )
2- Corresponding to each edge e~ of G we
~
 (f ** )  ( v * )
draw a line ~ e * which crosses e ~ but not Such that the membership of the dual of the
~
other edge of G , and joins the vertices ~v i* dual fuzzy graph is the membership of the
~ ~
~
which lie in the faces fi adjoining ~ e fuzzy graph itself such that G **  G
~* Proposition (2)
these line are the edges of G with degree
of membership (e *i )  (e i ) ; and The dual of fuzzy bipartite graph is an
 still satisfy the condition Eulerian fuzzy graph.
(e i )  min(( v i ), ( v i 1 )) where ~
* * *
v i* , ~
v i*1 Proof:
In this prove we consider the maximal
is the end of ~e * . i fuzzy bipartite graph with the degree of
~
3- Every faces of G * has a membership  membership (~ v),(e) and (f ) for the
such that  (f i* )  ( v i ). vertices, edges, and faces respectively.
The fuzzy dual of the planar graph in Fig.(5) is Since it is maximal fuzzy bipartite planar
shown in Fig.(7). graph then by definition (6) each cycles of

170
 Nuha abdul-jabbar

~ ~
even length, such that every face f in G have
even lengths.
So the dual of these faces f i for all
i=1,…,k obtained a vertices v *i of even degree
such that by theorem (1) the dual graph is
Eulerian fuzzy graph, with the degree of
membership ( v* )  (f ), (e* )  (e) and
 (f * )  ( v ) .

References
[1] B. Servatius and H. Servatius,"Dual
Eulerian Graphs", Obzornik Za
Matematico in Fiziko, Vol.50, No.1, 2003,
pp.14-20.
[2] D.B.West, "Introduction to Graph Theory",
Prentice-Hall Inc., 2001.
[3] L.S.Bershtein and T.A. Dziouba,
"Allocation of Maximal Bipartite Part from
Fuzzy Graph" http://citeseerix.ist.psu.doc,
2000, pp.207-211.
[4] M.R Berthold and k.huber, "Constructing
Fuzzy Graphs from Examples", Intelligent
data Analysis, Vol. 3, 1999, pp 37-53.
[5] M.S.Sunitha, ”Complement of a fuzzy
Graph” Indian J. pure appl. math.,
Vol.33No.9.2002,pp. 1451-1464.
[6] R.J. Wilson, "Introduction to Graph
Theory" Third Edition, Longman Inc,
1985.
[7] W.B. kandasamy, and F.Smarandaohe,
"Basic Neutrosophic Algebraic Structures
and their Application to Fuzzy Models"
American Reseach Press, 2004.

171

View publication stats