Trivial Fuzzy Topology of The Set of Fuzzy Graphs
Trivial Fuzzy Topology of The Set of Fuzzy Graphs
Trivial Fuzzy Topology of The Set of Fuzzy Graphs
II. PRELIMINARIES
A. Fuzzy Topology
__
C. Closure And Interior of Fuzzy Graphs From the above graph 0.5 & 1
The closure and interior of fuzzy topological graph IG D. Intersection of A Fuzzy Topological Graph
are defined respectively as, Two fuzzy topological graphs H and F in G are said to be
inf vi : vi vi , v j ; vi
c
intersecting if and only if there exists a vi G such
H F vi 0 then,
sup vi : vi vi , v j ; vi
that H and F intersect at
vi
A. Introduction:
In figure G1
(u1 , u2 ) (u2 , u3 ) (u1 , u3 ) 0 and Similarly the union of the edge set (ui , v j ) with any set
In figure G2 will be the set (ui , v j ) itself.
(u1 , u2 ) 0.3, (u2 , u3 ) 0.5, (u1, u3 ) 0.4 Hence,
As , (ui , v j ) , { (u1 , u2 )} (ui , j ) ,
first axiom of topology is satisfies. { (u1 , u3 )} (ui , j ) ,
Axiom 2 { (u1 , u2 )} { (u1 , u3 )} (ui , j ) .
To satisfy this axiom of topology, we have to check that the
We shall check using diagram whether
union of all the sub sets of the class lies in itself.
It is quite obvious that the union of a null edge set to any
{ (u1 , u2 )} { (u1 , u3 )}.
other edge set is the edge set it. Belongs to Or not.
{ (u1 , u2 )} , { (u1 , u3 )} ,
{ (ui , j )} ,
{ (u1 , u2 )} { (u1 , u3 )} (ui , j ) .
Axiom 3 The intersection of any edge set with the edge set
(ui , v j ) is the set itself.
We have to show that the intersection of all the subsets must
lie in itself. { (u1 , u2 )} (ui , j ) ,
The intersection of null edge set to any other edge subsets is { (u1 , u3 )} (ui , j ) ,
a edge set. Hence G must lie in the class itself.
{ (u1 , u2 )} { (u1 , u3 )} (ui , j ) .
{ (u1 , u2 )} , { (u1 , u3 )} ,
We now show that
{ (u1 , u2 )} { (u1 , u3 )} ,
{ (u1 , u2 )} { (u1 , u3 )} (ui , j ) . { (u1 , u2 )} { (u1 , u3 )}
Hence intersection on subsets of lies in itself. (ui , v j ) is always a topology on (ui , v j ) called
indiscrete fuzzy topological graph.
Therefore, the class D is discrete topology on the edge set
The pair ( (ui , v j ), ) is called an indiscrete fuzzy
(ui , v j ) and ( (ui , v j ), ) is a discrete fuzzy
topological graph.
topological graph.
Example
B. In Discrete Topology
Given edge set
(ui , v j ) { (u1 , v2 ), (u1, v3 ), (u4 , v5 )}
Let (ui , v j ) be any edge set, then the class
And a topology on it { , (ui , v j )}
{ , (ui , v j )} consisting of the empty set and the set
Axiom 1
It is satisfied as the null edge set, (i.e) and the complete
edge set (ui , v j ) belongs to the .
Axiom 2
It is also satisfied as the union of all the edge subsets of lies in itself.
Axiom 3
The last axiom of topology also holds true (i.e.) the intersection of all the edge subsets also lies in itself.
V. AMALGAMATIONS,EDGE CONTRACTION, sub graph H and G to a fuzzy topological sub graph H ' of
CONNECTIVITY AND BOUQUET OF CIRCLE
OF FUZZY GRAPHS G ' . The amalgamation G * f G ' is obtained from the
Theorem
Let the fuzzy topological graphs A and B are imbedded
Let A and B be two planar fuzzy topological planar graphs. disjointly in the plane. Hence, both the copies of vertex
Then the fuzzy topological graph obtained by amalgamating (vi ) or of the edges (ui , v j ) lie on the exterior region.
A and B either at a single vertex v or along a single edge
It would be easy to construct a planar imbedding of the
(ui , v j ) is planar. amalgamation for a vertex amalgamation, by pulling each
Proof: copy of the vertex (vi ) of the fuzzy graph A and B. Then
the amalgamation of the fuzzy topological graphs A and B
by the vertices forms a new fuzzy topological graph H.
H is the combination of two cycles and it is planar.
Let the value of the amalgamation vertex be Hence, the amalgamation of two edges of the fuzzy
(v) ( (vi ) (v j )) topological graphs A and B forms a new fuzzy topological
graph K.
For an edge amalgamation of each copy of an edge Therefore, K is also planar.
(ui , v j ) does the same pulling away as with a vertex.
B. Edge Contraction And Connectivity of Fuzzy Graphs
To get the respective copies of (ui , v j ) to the exterior
region, let A and B be first imbedded in separate copies of Suppose that the fuzzy topological graph G is obtained
'
the 2-cycle, and select in each copy a region that contains from the fuzzy topological graph G by contracting the edges
(ui , u j ) & (vi , v j ) on its boundary. Then paste the two vi , v j with end points u and v to the single
resulting cycles together by the edges. Thereby forming a
new 2-cycle in which the graphs A and B are imbedded so
vertex v ' .
that both copies of (ui , u j ) & (vi , v j ) lie on the
boundary of the same region.
One of those two vertices must be the vertex obtained by are adjacent. Deleting an edge and contraction of the
identifying the two end points of the edge u i , v j ; vertices vk to ui with all the edges related to
otherwise, the same set of two vertices would also vk of G gives a new fuzzy topological graph H. This
disconnect G, there by contradicting the connectivity of G.
ui , v j
will reduces the strength of the connectedness of G.
Thus for an edge the end points Therefore H is also connected.
ui ) & (vk of ui , v j together with the vertex Example
ui will give a new fuzzy topological graph H.
A connected fuzzy topological graph G with five or more
Let us choose an edge ui , v j and a vertex ui such vertices then contraction of any edge to the fuzzy
topological graph G is also connected.
that the largest component k of the graph
G { ui ), (v j } is the largest possible for any Solution
disconnecting set consisting of two vertices, two of which
Let G be a connected fuzzy topological graph with seven If (u, v) v5 , v6 then the strength of the
vertices let the vertex set be
connectedness will not be changed.
V {v1 , v2 , v3 , v4 , v5 , v6 , v7 } C. Minor of A Fuzzy Topological Graph
Now the contraction of edge v5 , v7 at the vertex
A fuzzy topological graph H is a minor of a fuzzy
v5 will form a new fuzzy topological graph H. Let us topological graph G if a copy of H can be obtained from G
calculate the strength of the connectedness. by deleting or contracting edges of G.
u, v 0.8 0
Therefore H is connected.
From that we conclude,
If (u, v) v5 , v6 then the strength of the
connectedness will be changed.
Theorem
A fuzzy topological graph G is planar if and only if neither
K5 nor K3,3 is a minor of G
Proof
Let G be planar and K5 nor K3,3
Suppose K5 or K3,3 is a minor of G
We know that,If a fuzzy graph G is planar if and only it does
not contain a sub graph which is homeomorphic from K5 or
K3,3
D. Bouquets of Circles of Fuzzy Graphs Every complement of a fuzzy topological graph is open,
A Bouquet of n circles is a fuzzy topological graph with The complete fuzzy topological graph Kn+1 is
one vertex and n loops. The standard model is denoted Bn. isomorphic to the suspension of the complete fuzzy
topological graph Kn from the fuzzy topological graph
K1.
The suspension of two complete fuzzy topological
graph will become a complete bipartite fuzzy
topological graph.
(i.e.) Km + Kn = Kmn
(Km + Kn)C = Kmn (Membership value become 0)
((Km + Kn)C )C = Kmn.
Suspension of two fuzzy topological planar graphs need
not be a planar fuzzy topological graph.
Amalgamation of two fuzzy topological planar graphs
will be afuzzy topological planar graph.
The edge complement K nC of the complete fuzzy
topological graph has no edges at all but has n vertices
BIBLIOGRAPHY