Dharshu Con Merged

FUZZY GRAPH COLORING AND ITS APPLICATION
1
DHARSHANA S. S, 2 Dr. R. SHEEBA
1
II M.Sc. Mathematics, Sree Ayyappa college for Women, Chunkankadai.
2
Assistant Professor, P.G Department of Mathematics, Sree Ayyappa college for
Women, Chunkankadai.
Abstract :
Coloring of fuzzy graphs has several real life applications in combinatorial optimization
issues like traffic light system, examination programming, register allocation, etc. In this paper,
we analyze the vertex and edge coloring on bipartite graphs using the concept of as fuzzy
numbers through the α-cuts of the fuzzy graphs which are crisp graphs.
Key words: Fuzzy graphs, Fuzzy chromatic number

Introduction:
Graph theory, branch of mathematics concerned with network of points connected by
links. The origin of Graph theory started with the problem oh Kӧinsberg bridge in 1735. The
Swiss mathematician Leonhard Euler solved this Kӧinsberg problem. The Kӧinsberg bridge
problem was an old puzzle concerning the possibility of finding a path over every one of the
seven bridge that span a forked river flowing past an island but without crossing any bridge
twice. In graph theory, Graph coloring is a special case of graph labelling of colours to
components of graphs. The first result about graph coloring deals almost with the planar graph
in the form of coloring of maps. While trying to color the map of the countries of England,
Francis Guthrie, postulated the four color conjecture, noting that four colors were sufficient to
color the map so that no regions sharing common border receiving same color. In 1879, Alfred
Kempe published a paper that claimed to establish the result. In 1890 Heawood said that every
planar map can be colored with no more than five colors, using the idea of Kempe. Finally the
four color problem was proved in 1976 by Kenneth Appel and Wolfgang Haken.
As an advancement fuzzy coloring of a fuzzy graph was outlined by authors Eslahchi
and Onagh in 2004, and later developed by them a fuzzy vertex coloring in 2006. This fuzzy
vertex coloring was extended to fuzzy total coloring in terms of family of fuzzy set by
S.Lavanya and R.Sattanathan. The concept of chromatic number of fuzzy graphs was
introduced by Munoz.S. Eslahchi and Onagh defined fuzzy coloring of fuzzy graphs and
defined fuzzy chromatic number 𝜒 𝑓 (𝐺). Anjaly and Sunitha introduced chromatic number
𝜒(𝐺) of fuzzy graphs G incorporating the features of definition given in Munoz and Eslahchi[8]
and established that𝜒(𝐺) = 𝜒 𝑓 (𝐺).
Definition 1.1:
A fuzzy graph G = (V, σ, µ) is a triple consisting of a nonempty set V together with a pair
of functions σ : V → [0, 1] and µ : E → [0, 1] such that for all x, y ∈ V, µ(xy) ≤ σ(x) ∧ σ(y)
Definition 1.2 :
The α – cut set of fuzzy set A is defined as 𝐴 is made up of member whose membership
is not less than α. 𝐴 = {(u, v) 𝜖 V ×V : µ(u, v) > 0}. α- cut set of fuzzy set A
Definition 1.3 :
The α– cut set of fuzzy set of fuzzy graph defined as 𝐺 = (𝑉 , 𝐸 )where 𝑉 = {v 𝜖 𝑉 : σ ≥ α }

and 𝐸 = {e 𝜖 E : µ ≥ α }.
Definition 1.4 :
Two vertices u and v in G are adjacent if [σ(u) ∧ σ(v)] ≤ µ(u, v)
Definition 1.5 :
The degree of vertex v in G denoted by degG(v) is the number of adjacent vertices
to V and maximum degree of G is defined by △(G) = max {degG(v): v 𝜖 V} and the minimum
degree is δ(G) = min{degG(v): v 𝜖 V}.
Definition 1.6 :
A fuzzy graph is said to be complete if µ(u, v) = σ(u) ∧ σ(v) ∀ u, v 𝜖 V

Definition 1.7 :
Given a graph G : (V, E), a coloring function is mapping C : V → N identifying C (i) as

the color of a node i 𝜖 V, in such a way that adjacent nodes cannot share the same color, C(i) ≠
C(j) if {i, j} 𝜖 V
Definition 1.8 :
For a fuzzy graph 𝐺 = (V, µ), its vertex chromatic number is the fuzzy number
χ (G) = {(x, v(x)) : x 𝜖 X} where X = {1,2, …|𝑉|}, v(x) = sup {α 𝜖 I : x 𝜖 𝐴 }, x 𝜖 X, 𝐴 = {1,2,
… . , 𝑋 }, α 𝜖 I.
Definition 1.9 :
For a fuzzy graph 𝐺 = (V, µ), its edge chromatic number is the fuzzy number
՛
𝜒 (𝐺 ) = {(x, λ(x)) : x 𝜖 X} where X = {1,2, … , Δ+1}, λ(x) = sup {α 𝜖 I : x 𝜖 𝐴 },
𝐴 = {1,2, … . , 𝜒 ՛ }, α 𝜖 I.
Definition 1.10 :
For a fuzzy graph 𝐺 = (V, µ), its total chromatic number is the fuzzy number
𝜒 (𝐺 ) = {(x, τ(x)) : x 𝜖 X} where X = {1,2, … , Δ+2}, τ(x) = sup {α 𝜖 I : x 𝜖 𝐴 },
𝐴 = {1,2, … . ,𝜒 }, α 𝜖 I.
2. Fuzzy Coloring Using α – Cuts:
Using α – cuts of the complete bipartite fuzzy graph we have colored the vertex,
edge and both vertex and edges of fuzzy graph.
2.1 Vertex coloring of fuzzy graph using α – cuts:
Let we take a fuzzy graph G = (V, σ, µ) where V has six vertices and
membership values of those vertices are σ = {0.6,1,0.6,0.8,0.9,0.8} and the graph G has 9 edges
and membership values of these edges are in µ.
𝑣 𝑣 𝑣 𝑣 𝑣 𝑣
𝑣 0 0 0 𝑒 𝑒 𝑒
𝑣 ⎡0 0 0 𝑒 𝑒 𝑒 ⎤
𝑣 ⎢ ⎥
µ=𝑣 ⎢0 0 0 𝑒 𝑒 𝑒 ⎥
⎢𝑒 𝑒 𝑒 0 0 0⎥
𝑣 ⎢𝑒 𝑒 𝑒 0 0 0⎥
𝑣 ⎣𝑒 𝑒 𝑒 0 0 0⎦
Adjacent Matrix I
𝑣 0 0 0 0.8 0.5 0.5
𝑣 ⎡0 0 0 0.7 0.8 0.7⎤
𝑣 ⎢ ⎥
µ=𝑣 ⎢0 0 0 0.6 0.6 0.5⎥
⎢ 0.8 0.7 0.6 0 0 0⎥
𝑣 ⎢0.5 0.8 0.7 0 0 0⎥
𝑣 ⎣0.5 0.7 0.5 0 0 0⎦
Adjacent Matrix II
Here the adjacent matrix I represents the name of edges between the vertices and adjacent
matrix II represents the membership values of the edges.
Example:
Edge between the vertices v1 and v4 is e9 and the membership value of that edge is 0.8.
Let fuzzy graph G = (VF,EF) be a fuzzy graph where
V1 = {(V1,0.6) , (V2, 1) , (V3,0.6) , (V4, 0.8) , (V5, 0.9) , (V6, 0.8)}
EF = {(e1,0.5), (e2,0.7), (e3,0.5), (e4,0.8), (e5,0.5), (e6,0.6), (e7,0.6), (e8,0.7), (e9,0.8)}
In the above defined fuzzy graph, there are six α – cuts are presented. They are
{0.6,1,0.6,0.8,0.9,0.8}. For every value of α, we can find the graph 𝐺 and its fuzzy chromatic
number.
For α = 0.5, fuzzy graph G = (V, σ, µ) and where σ = {0.6,1,0.6,0.8,0.9,0.8} and
𝑣 0 0 0 0.8 0.5 0.5
𝑣 ⎡0 0 0 0.7 0.8 0.7⎤
𝑣 ⎢ ⎥
⎢ 0 0 0 0.6 0.6 0.5⎥
µ=𝑣
⎢0.8 0.7 0.6 0 0 0⎥
𝑣 ⎢0.5 0.8 0.7 0 0 0⎥
𝑣 ⎣0.5 0.7 0.5 0 0 0⎦
For α = 0.5, 𝐺 . = (𝑉 . , 𝐸 . ) where 𝑉 . and 𝐸 . both are crisp set. 𝑉 . is the collection
of those elements of fuzzy set 𝑉 whose membership value is greater than or equal to 0.5. 𝑉 .
= { v1, v2, v3, v4, v5 ,v6} and same as 𝐸 . is a collection of those element of fuzzy set 𝐸 whose
membership values are greater than or equal to 0.5.
So 𝐸 . = {𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 }. Here we need minimum 6 color to proper

color all the vertices of the graph 𝐺 . , so the chromatic number of 𝐺 . is 6.
For α = 0.5, 𝜒 . = χ(𝐺 . ) = 6

For α = 0.6, fuzzy graph G = (V, σ, µ) and where σ = {0.6,1,0.6,0.8,0.9,0.8} and
𝑣 0 0 0 0.8 0.0 0.0
𝑣 ⎡0 0 0 0.7 0.8 0.7⎤
𝑣 ⎢ ⎥
µ=𝑣 ⎢0 0 0 0.6 0.6 0.0⎥
⎢ 0.8 0.7 0.6 0 0 0⎥
𝑣 ⎢0.0 0.8 0.7 0 0 0⎥
𝑣 ⎣0.0 0.7 0.0 0 0 0⎦
We find the graph 𝐺 . = (𝑉 . , 𝐸 . ) where 𝑉 . = { v1, v2, v3, v4, v5 ,v6} and
𝐸 . ={𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 }. Here we need minimum 3 color to proper color all the vertices of
the vertices of the graph 𝐺 . , so the chromatic number of graph 𝐺 . is 3.
For α = 0.6, 𝜒 . = χ(𝐺 . ) = 3.

For α = 0.7, fuzzy graph G = (V, σ, µ) and where σ = {1, 0.8,0.9,0.8} and
𝑣 𝑣 𝑣 𝑣
𝑣 0 0 0.8 0.7
𝑣 0 0 0 0
µ=𝑣
0.8 0 0 0
𝑣 0.7 0 0 0
We find the graph 𝐺 . = (𝑉 . , 𝐸 . ) where 𝑉 . = {v2, v4, v5 ,v6} and
𝐸 . ={𝑒 , 𝑒 }. Here we need minimum 3 color to proper color all the vertices of the vertices of
the graph 𝐺 . , so the chromatic number of graph 𝐺 . is 3.
For α = 0.7, 𝜒 . = χ(𝐺 . ) = 3.

For α = 0.8, fuzzy graph G = (V, σ, µ) and where σ = {1, 0.8,0.9,0.8} and
𝑣 𝑣 𝑣 𝑣
𝑣 0 0 0.8 0
𝑣 0 0 0 0
µ=𝑣
0.8 0 0 0
𝑣 0 0 0 0
We find the graph 𝐺 . = (𝑉 . , 𝐸 . ) where 𝑉 . = {v2, v4, v5 ,v6} and
𝐸 . ={ 𝑒 }. Here we need minimum 2 color to proper color all the vertices of the vertices of
the graph 𝐺 . , so the chromatic number of graph 𝐺 . is 2.
For α = 0.8, 𝜒 . = χ(𝐺 . ) = 2.
For α = 0.9, fuzzy graph G = (V, σ, µ) and where σ = {1, 0.9,} and
𝑣 𝑣
𝑣 0 0
µ =𝑣
0 0
We find the graph 𝐺 . = (𝑉 . , 𝐸 . ) where 𝑉 . = { v2 ,v5} and
𝐸 . ={ }. Here we need minimum 1 color to proper color all the vertices of the vertices of the
graph 𝐺 . , so the chromatic number of graph 𝐺 . is 1.
For α = 0.9, 𝜒 . = χ(𝐺 . ) = 1.

For α = 1, fuzzy graph G = (V, σ, µ) and where σ = {1} and we find the graph 𝐺 = (𝑉 , 𝐸 )
where 𝑉 = { v2} and 𝐸 ={ }. Here we need minimum 1 color to proper color all the vertices
of the vertices of the graph 𝐺 , so the chromatic number of graph 𝐺 is 1.
For α = 1, 𝜒 = χ(𝐺 ) = 1.
In the above example, six crisp graphs 𝐺 = (𝑉 , 𝐸 ) are obtained by considering values of α.
Now the chromatic number𝜒 for any α, it can be shown that the chromatic number of fuzzy
graph G is
χ(G) ={(6,0.5), (3,0.6), (3,0.7), (2,0.8), (1,0.9), (1,1)}.
2.2 Edge coloring of fuzzy graphs using α – cuts:
Let 𝐺 = {(V, 𝐸 ) : α 𝜖 I} be the family of α – cuts of 𝐺 , where the α – cuts of a
fuzzy graphs is a crisp graph 𝐺 = (V, 𝐸 ) with 𝐸 = {(i, j) : i, j 𝜖 V, µ ≥ α}. In a crisp case
the edge chromatic number of the graph is either Δ or Δ+1 where Δ is the maximum degree.
For each α 𝜖 I, the following Table 2.1 contains edge set 𝐸 , the edge chromatic number 𝜒 ՛ .
Six crisp graphs 𝐺 = {(V, 𝐸 ) corresponding to each α is given below.
Table 2.1
α 𝐸 χ cα(14) cα(15) cα(16) cα(24) cα(25) cα(26) cα(34) cα(35) cα(36)

0.4 14,15,16,24,
25,26,34,35, 3 2 3 1 2 1 3 2 1 3
36
0.5 14,15,24,25,
3 0 3 1 2 1 3 2 1 3
26,34,35,36
0.6 14,24,25,26,
3 0 3 0 2 0 3 2 1 3
34,35,36
0.7 14,25,34,35, 3 0 3 0 2 0 0 0 1 3
0.8 35 1 0 0 0 1 0 0 0 0 1
0.9 ϕ 0 0 0 0 0 0 0 0 0 0
*(Red – 1, Pink – 2, Green – 3)
α = 0.4 𝜒՛ = 3
α = 0.9 𝜒՛ = 0
Since Δ = 3, for the given graph, then the fuzzy edge chromatic number of 𝐺 is
𝜒 ՛ = {(1, 0.8) (2, 0) (3, 0.4)}. Hence the chromatic number is 𝜒 ՛ = 3.
2.3 Fuzzy total coloring using α – cuts:
Let 𝐺 = {(V, 𝐸 ) : α 𝜖 I} be the family of α – cuts of 𝐺 , where the α – cuts of a fuzzy

graphs is a crisp graph 𝐺 = (V, 𝐸 ) with 𝐸 = {(i, j) : i, j 𝜖 V, µ ≥ α}.
In a crisp case the total chromatic number of the graph is atmost Δ + 2 where Δ is the
maximum degree. Consider for each α 𝜖 I, the following Table 2.2 contains 𝑐 : (V ∪ E) →
{1,2, … , k} and the total chromatic number 𝜒 . Six crisp graph 𝐺 = (V, 𝐸 ) corresponding
to each α is given below.
Table 2.2
α 𝜒 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐 𝑐
(1) (2) (3) (4) (5) (6) (14) (15) (16) (24) (25) (26) (34) (35) (36)
0.4 5 2 2 5 3 4 4 1 3 2 1 5 3 1 5 4
0.5 5 2 2 5 3 4 4 0 3 2 1 5 3 1 5 4
0.6 5 2 2 2 3 4 4 0 3 0 1 0 3 1 5 4
0.7 4 2 2 2 3 4 4 0 3 0 1 0 0 1 5 0
0.8 3 3 1 3 1 2 1 0 0 0 1 0 0 1 0 0
0.9 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0
*(Blue – 1, Green – 2, Pink – 3, Red – 4, violet – 5)
α = 0.4 𝜒 =5
α = 0.9 𝜒 =1
Since Δ = 3, the chromatic number is 𝜒 = 5. And the total chromatic number
𝜒 = {(1, 0.9), (2, 0), (3, 0.8), (4, 0.7), (5, 0.4)}.
3. APPLICATIONS OF FUZZY COLORING
3.1 The traffic lights problem :
The control policy of the traffic light depends mainly on the number of vehicles in the
intersection line. If the traffic flow in the intersection line is high then there is a possibility of
accident. When the number of vehicles in the intersection line is low then there may be less
possibility of accident. The concept of accident and number of vehicles in each line could be
fuzzy and it could be graduated. This graduation, which does not need to be numerical, is
associated to the desired security level for the traffic. Here we represent each traffic flow with
a fuzzy edge whose membership value depends on the number of the vehicles in that path. Two
fuzzy vertices are adjacent if the corresponding traffic flows cross each other then there is a
possibility of accident. Possibility of accident value will depend on vertex membership value.
The maximum security level is attained when all lanes are considered to be in intersection with
each other and the number of vehicles in each line is also high. So graph will be a complete
graph. In this case, the chromatic number is the number of lanes and the control policy of the
lights assure that only one movement is allowed in any slot of the cycle. On the other hand, the
minimum security level is attained when the intersection edge set is empty; in this case, the
chromatic number is 1 and all movements are allowed at any instant. Since the four right turns
do not interfere with the other traffic flows, they can safely be dropped from our discussion.
Membership values can be represented by symbolic name H for high, M for medium for low
respectively.
3.2 Scheduling :
Vertex coloring models to a number of scheduling problems. In the cleanest form, a
given set of jobs need to be assigned to time slots, each job requires one such slot. Jobs can be
scheduled in any order, but pairs of jobs may be in conflict in the sense that they may not be
assigned to the same time slot, for example because they both rely on a shared resource. The
corresponding graph contains a vertex for every job and an edge for every conflicting pair of
jobs. The chromatic number of the graph is exactly the minimum make span, the optimal time
to finish all jobs without conflicts. Details of the scheduling problem define the structure of the
graph. For example, when assigning aircraft to flights, the resulting conflict graph is an interval
graph, so the coloring problem can be solved efficiently. In bandwidth allocation to radio
stations, the resulting conflict graph is a unit disk graph, so the coloring problem is 3-
approximable.
3.3 Job Scheduling :
Here the jobs are assumed as the vertices of the graph and there is an edge between two
jobs 1 they cannot be executed simultaneously. There is a 1-1 correspondence between the
feasible scheduling of the jobs and the colorings of the graph.
4. CONCLUSION :
The fuzzy coloring of fuzzy graphs arises widely in modelling real life problems. Using
this concept, we can represent the traffic flows whose vertices and edges both are fuzzy vertices
and fuzzy arcs. Using this membership value of edges and vertices, we can introduce a method
to classify the accidental zone of a traffic flows. By the interpretation of 𝜒(𝐺), we can show that
the lower values of α are associated to lower driver aptitude levels and consequently, the traffic
lights must be controlled conservatively and the chromatic number is high and for higher values
of α, the driver aptitude levels increase and the chromatic number is lower, allowing a less
conservative control of the traffic lights and a a lot of fluid traffic flow. And also we can use
this concept in job scheduling, timetable scheduling also.
References:
[1].M. Ananthanarayanan and S. Lavanya, Fuzzy graph ccoloring using 𝛼 − 𝑐𝑢𝑡𝑠, International
Journal of Engineering and Applied Science,Vol-4(2014).
[2].Anjaly Kishore and M.S. Sunitha, Chromatic number of fuzzy graphs, Annals of Fuzzy
Mathematics and Informatics,Vol-7(2014) pp 543-551.
[3].Arindam Dey and Anita Pal, Vertex coloring of fuzzy graphs using alpha cuts, International
journal of Management, ITand Engineering, Vol (2),2012 .
[4].Arindam Dey and Anita Pal, Fuzzy graph coloring technique to classify accidental zone of
a traffic control, Annals of Pure and Applied Mathematics, Vol-3(2) 2013, pp 169-178.
[5].N. Biggs, Algebraic graph theory, Cambridge university press,1974.
[6].J.A. Bondy and U.S.R. Murty, Graph theory with Applications, Macmillan, 1978.
[7].Eslahchi. C and Onagh B.N, Vertex strength of fuzzy graphs, International Journal of
Mathematics and Mathematical Science(2006),pp 1-9.
[8].Harary, Graph theory, Addison Wesley Publishing Company,1969.
[9].S. Kavitha and S. Lavanya, Fuzzy chromatic number of Line,Total and Middle graphs of
Fuzzy complete graphs, Annals of Pure and Applied Mathematics, Vol 2(2014) pp 251-260.
[10]. S. Munoz, T. Ortuno, J. Ramirez, J. Yanez, Coloring of fuzzy graphs, Omega, The
International Journal of Management Science 33(2005) 211-221.
[11]. V. Nivethana and Dr(Mrs) A. Parvathi, Fuzzy total coloring and chromatic number of a
complete graph, International Journal of Emering Trends in Engineering and Developement,
Vol 6 (2013).
[12]. Robin J Wilson, Introduction to Graph theory, Prentice Hall,1994.
[13]. M.S. Sunitha and S. Mathew, Fuzzy graph theory: a survey, Annals of Pure and Applied
Mathematics 4(1)(2013)92-110.
[14]. A.K.Bincy and B.Jeba Presitha , Graph Coloring and its Real Time Applications an
Overview, International Journal of Mathematics And its Applications, Volume 5, Issue 4–F
(2017), 845–849. ISSN: 2347-1557
CONTINUOUS MONOTONIC TREE DECOMPOSITION
P. Arathi
Department of Mathematics
Sree Ayyappa College for Women
Chunkankadai, Tamil Nadu, India.
Dr. D. Jeya Jothi

Department of Mathematics
Sree Ayyappa College for Women
Chunkankadai, Tamil Nadu, India.
Abstract: Let G = (V, E) be a simple graph. A decomposition { , , … , } of G is said to

be Continuous Monotonic Tree Decomposition (CMTD). If i) E(G) = E( ) ∪ E( ) ∪ … ∪
E( ) ii) Each is a tree iii) ( ) = i, 1 ≤ i ≤ n. In this paper, we investigate the
Continuous Monotonic Tree Decomposition of Complete graph.
Key word: Decomposition, Tree Decomposition, Continuous Monotonic Decomposition,
Continuous Monotonic Tree Decomposition.
1. Introduction
All basic terminologies from Graph Theory are used in the sense of Frank Harary. A
graph considered here are simple undirected graph without loop or multiple edges. As usual
p and q denote the vertices and edges of a graph G respectively.
Let G = ( , E) be a simple graph if , , …, are edge disjoint subgraphs of G
such that E(G) = E( ) ∪ E( ) ∪ … ∪ E( ),then { , , … , } is said to be a
Decomposition of G.
A graph which is connected and acyclic is called Tree.
The concept of tree decomposition was originally introduced by Rudolf Halin (1976). It was
rediscovered by Neil Robertson and Paul Seymour (1984). The following definition of tree
decomposition from Gerrod Voigt in “Tree Decompositions, Treewidth, and NP – Hard
Problems”.
A Tree decomposition of a graph G = (V, E) is a tree T, where
1) Each vertex i of T is labeled by a subset ⊂ V of vertices of G, referred to
as a bag
2) Each edge of G is in a subgraph induced by atleast one of the
3) The subtree of T consisting of all bags containing u is connected for all
vertices u in G.
A decomposition { , , … , } of G is said to be Continuous Monotonic
Decomposition. If each is connected and ( ) = i, 1 ≤ i ≤ n. This concept was
introduced by J. Paulraj and N. Gnanadhas in “Continuous Monotonic Decomposition of
some Graph”.
A simple graph in which each pair of distinct vertices is joined by an edge is called a
complete graph. A complete graph with n vertices is denoted by .
In this paper, we investigate some results in Continuous Monotonic Tree
Decomposition of Complete graph.
2. Continuous Monotonic Tree Decomposition of Graphs

In this section we investigate Continuous Monotonic Tree Decomposition of graph.
Let G = (V, E) be a simple graph. A decomposition { , , … , } of G is said to
be Continuous Monotonic Tree Decomposition (CMTD). If i) E(G) = E( ) ∪ E( ) ∪ … ∪
E( ) ii) Each is a tree iii) ( ) = i, 1 ≤ i ≤ n.
If the graph G admits Continuous Monotonic Tree Decomposition, then the
connected subgraph are said to be ‘Bags’. The bags are three types:
1) The bags which has n leaves always contains (2n – 1) nodes (vertices) are strictly
binary tree and is denoted by ( ).
2) The bags in which each vertex has at most two children and each child of a vertex is
designated as its left or right child are binary tree and is denoted by ( ).
3) The bags which are neither strictly binary tree nor binary tree is denoted by ( ).
The total number of Strictly binary tree bags are denoted by Ο(SB).
Example2.1: The following figure illustrates the Continuous Monotonic Tree Decomposition
of Peterson graph.
Peterson graph
Figure 2.1: Continuous monotonic tree decomposition of Peterson graph.

3. Continuous Monotonic tree decomposition of complete graph
In this section we investigate Continuous Monotonic Tree Decomposition of

Complete graph .
(i) If admits Continuous monotonic tree decomposition, then n ≤ 4 does not contain
neither nor bags.
(ii) The even bags { , , … , }, n ≥ 2 are Strictly binary tree bags.
(iii) The odd bags { , , … , }, n ≥ 2 are Binary tree bags.
Theorem 3.1: Every Complete graph , n ≥ 2 admits CMTD.

Proof: We have any graph G admits CMD iff q = , where q is the number of edges in
( )
G. That is, the graph G with q = 1 (or) q = 3 (or) … (or) q = admits CMD.
We prove this theorem by induction on n. For n = 2, has q = 1.
Therefore, admits CMD.
Since admits CMD, ( ) = 1 where is the decomposition of .
Claim: is a tree.
It is enough to show that q = p – 1.
q = 2 – 1 = 1.
Thus, is a tree.
Hence admits CMTD.
Assume the theorem is true for .
To prove the theorem is true for .
( )
In , q = . admits CMD.
Since admits CMD, ( ) = 1, ( ) = 2, …, ( ) = n - 1.
Where , , … , are decomposition of .
By induction hypothesis, , , … , are trees. It remains to prove is tree.
q = n – 1.
Thus, is tree.
Hence admits CMTD.
Example 3.2: The following figure illustrates the Continuous Monotonic Tree
Decomposition of the complete graph .
Graph
Figure 2.1: Continuous monotonic tree decomposition of .
Theorem 3.3: Let , n ≥ 2 admits CMTD, then it has (n – 1) bags.

Proof: Assume admits CMTD.
To prove: has (n – 1) bags.
( )
We know that the total number of edges in complete graph, E( n ) =
We prove this by contra positives.
Suppose has n bags. Let it be { , , …, }.
By the definition of CMTD, ( ) = 1, ( ) = 2, …, ( ) = n.
( )
Here E( n ) = E( ) ∪ E( ) ∪ … ∪ E( ) = 1 + 2 + …+n =
( ) ( )
E( n ) = > .
Thus, our assumption is wrong.
Hence has (n – 1) bags.
Theorem 3.4: The complete graph and admits CMTD, then it has
Ο(SB ( )) = Ο(SB ( )) = n.
Proof: Assume that and admits CMTD.
To prove that Ο(SB ( )) = Ο(SB ( )) = n.
Since and admits CMTD, it has (2n + 2) and (2n + 3) bags respectively.
Let the bags be { , , …, , , } of and{ , , …, , , ,
} of .
Since , , are bags, so we neglect , and .
Therefore, the remaining bags are { , , …, , , } of and{ , , …,
, , , } of .
Since the even bags , i is even are , we have { , , …, , } of
and{ , , …, ,, } of are .
Therefore, ( ) and ( ) are { , , …, , }.
Ο(SB ( )) = n.
Ο(SB ( )) = Ο(SB ( )) = n.
Corollary 3.5: The complete graph and admits CMTD, then it has
Ο(B ( )) = Ο(B ( )) = n.
Table 3.6: Continuous monotonic tree decomposition of .
Complete graph CMTD Strictly binary tree Binary tree bags

bags
- -
, - -
, , - -
, , , -
, , , ,
, , , , , ,
, , , , , , ,
,
, , , , , , ,
, , ,
Reference
1. Harary F, Graph Theory, Narosa Publishing House, New Delhi, 1998.
2. Dougles B. West, Introduction to Graph theory, Prentice-Hall of India Private Limited,
New Delhi – 110 001, 2001.
3. Gerrod Voigt, Tree Decomposition, Tree - width, and NP-Hard Problems, Massachusetts
Institute of Technology.
4. N. Gnanadhas and J. Paulraj Joseph, “Continuous Monotonic Decomposition of Graphs.”
International Journal of Management and Systems, 16 (2000): 333-344.
5. C. Huang and A. Rosa Decomposition of complete graphs into trees, Ars Combin,
5(1978), 23 – 63.
6. G. Haggard, and P, Mc Wha,. Decomposition of complete graphs into trees,
Czechoslov.math.J, 25(1975), 31 – 36.
A STUDY ON REGULAR AND TOTALLY REGULAR
FUZZY GRAPHS
R. ANUSHA¹, Dr. R.S. SHEEBA²
¹II M.sc. Mathematics, Sree Ayyappa College for Women, Chunkankadai.

²Assistant Professor, P.G. Department of Mathematics, Sree Ayyappa College for Women,
Chunkankadai.
Abstract:
In this paper, regular fuzzy graphs, total degree and totally regular fuzzy graphs are
introduced. Regular fuzzy graph and totally regular fuzzy graph are compared through
various examples. A necessary and sufficient condition under which they are equivalent is
provided.
Keywords:
Fuzzy graph, degree of a vertex, regular fuzzy graph, total degree, totally regular fuzzy
graph.
1. Introduction
Fuzzy graph theory was introduced by Azriel Rosenfeld in 1975. Though it is very
young, it has been growing fast and numerous applications in various fields. In this paper,
we introduce regular fuzzy graphs, total degree and totally regular fuzzy graphs. We make a
comparative study between regular and totally regular fuzzy graphs through various
examples. We provide a necessary and sufficient condition under which they become
equivalent.
First we go through some definitions which can be found in [1] − [5].
2. Preliminaries
Definition 2.1:
A fuzzy graph 𝐺 = (𝑉, 𝜎, 𝜇) is a triple consisting of a non empty set V together with
a pair of functions where 𝜎: 𝑉 → [0, 1] and 𝜇: 𝑉 × 𝑉 → [0, 1] such that for all 𝑢, 𝑣 in V the
relation 𝜇(𝑢𝑣) ≤ 𝜎(𝑢) ∧ 𝜎(𝑣) is satisfied.
Definition 2.2:
Let 𝐺 = (𝜎, 𝜇) be a fuzzy graph. The degree of a vertex u is 𝑑𝐺 (𝑢) = ∑𝑢≠𝑣 𝜇(𝑢𝑣).
Since 𝜇(𝑢𝑣) >0 for 𝑢𝑣 ∈ 𝐸 and 𝜇(𝑢𝑣) = 0 for 𝑢𝑣 ∉ 𝐸, this is equivalent to
𝑑𝐺 (𝑢) = ∑𝑢=𝑣 𝜇(𝑢𝑣).
The minimum degree of G is 𝛿(𝐺) =∧ {𝑑(𝑣) ∕ 𝑣 ∈ 𝑉}.
The maximum degree of G is ∆(𝐺) =∨ {𝑑(𝑣) ∕ 𝑣 ∈ 𝑉}.
Definition 2.3:
Let 𝐺 = (𝜎, 𝜇) be fuzzy graph on 𝐺 ∗ = (𝑉, 𝐸). If 𝑑(𝑣) = 𝑘 for all 𝑣 ∈ 𝑉, then G is
said to be regular fuzzy graph of degree k.
Definition 2.4:
Let 𝐺 = (𝜎, 𝜇) be fuzzy graph on 𝐺 ∗ = (𝑉, 𝐸). The total degree of a vertex u is
defined as 𝑡𝑑(𝑢) = ∑ 𝜇(𝑢𝑣) + 𝜎(𝑢) = 𝑑𝐺 (𝑢) + 𝜎(𝑢), 𝑢𝑣 ∈ 𝐸.
Definition 2.5:
Let 𝐺 = (𝜎, 𝜇) be fuzzy graph on 𝐺 ∗ = (𝑉, 𝐸). If each vertex in G has same total
degree k, then G is said to be a totally regular fuzzy graph or k - totally regular fuzzy graph.
3. Main result
Theorem 3.1:
Let 𝐺 = (𝜎, 𝜇) be a fuzzy graph on 𝐺 ∗ = (𝑉, 𝐸). Then 𝜎 is a constant function if and only if
the following are equivalent:
(1) 𝐺 is a regular fuzzy graph.
(2) 𝐺 is a totally regular fuzzy graph.
Proof:
Suppose that 𝜎 is a constant function.
Let 𝜎(𝑢) = 𝑐, a constant, for all 𝑢 ∈ 𝑉.
Assume that G is a 𝑘1 – regular fuzzy graph.
Then 𝑑(𝑢) = 𝑘1 , for all 𝑢 ∈ 𝑉.
So 𝑡𝑑(𝑢) = 𝑑(𝑢) + 𝜎(𝑢), for all 𝑢 ∈ 𝑉.
⟹ 𝑡𝑑(𝑢) = 𝑘1 + 𝑐, for all 𝑢 ∈ 𝑉.
Hence G is a totally regular fuzzy graph.
Thus (1) ⟹ (2) is proved.
Now, suppose that G is a 𝑘2 – totally regular fuzzy graph.
Then 𝑡𝑑(𝑢) = 𝑘2 , for all 𝑢 ∈ 𝑉.
⟹ 𝑑(𝑢) + 𝜎(𝑢) = 𝑘2 , for all 𝑢 ∈ 𝑉.
⟹ 𝑑(𝑢) + 𝑐 = 𝑘2 , for all 𝑢 ∈ 𝑉.
⟹ 𝑑(𝑢) = 𝑘2 − 𝑐, for all 𝑢 ∈ 𝑉.
So G is a regular fuzzy graph.
Thus (2) ⇒ (1) is proved.
Hence (1) and (2) are equivalent.
Conversely, Assume that (1) and (2) are equivalent, that is G is regular if and only if G
is totally regular.
Suppose 𝜎 is not a constant function.
Then 𝜎(𝑢) ≠ 𝜎(𝑤) for at least one pair of vertices 𝑢, 𝑣 ∈ 𝑉.
Let G be a k - regular fuzzy graph. Then 𝑑(𝑢) = 𝑑(𝑤) = 𝑘.
So 𝑡𝑑(𝑢) = 𝑑(𝑢) + 𝜎(𝑢) = 𝑘 + 𝜎(𝑢) and 𝑡𝑑(𝑤) = 𝑑(𝑤) + 𝜎(𝑤)
= 𝑘 + 𝜎(𝑤)
Since 𝜎(𝑢) ≠ 𝜎(𝑤), we have 𝑡𝑑(𝑢) ≠ 𝑡𝑑(𝑤).
So G is not totally regular which is a contradiction to our assumption.
Now let G be a totally regular fuzzy graph.
Then td(u) = td(w) ⟹ d(u) + σ(u) = d(w) + σ(w)
⟹ d(u) − d(w) = σ(w) − σ(u) ≠0
⟹ d(u) ≠ d(w).
So G is not regular which is a contradiction to our assumption.
Hence 𝜎 is a constant function.
Theorem 3.2:
If a fuzzy graph G is both regular and totally regular, then 𝜎 is a constant function.
Proof:
Let G be a 𝑘1 - regular and 𝑘2 – totally regular fuzzy graph.
So 𝑑(𝑢) = 𝑘1 , for all 𝑢 ∈ 𝑉 and 𝑡𝑑(𝑢) = 𝑘2 , for all 𝑢 ∈ 𝑉.
Now 𝑡𝑑(𝑢) = 𝑘2 , for all 𝑢 ∈ 𝑉.
⟹ 𝑑(𝑢) + 𝜎(𝑢) = 𝑘2 , for all 𝑢 ∈ 𝑉.
⟹ 𝑘1 + 𝜎(𝑢) = 𝑘2 , for all 𝑢 ∈ 𝑉.
⟹ 𝜎(𝑢) = 𝑘2 − 𝑘1 , for all 𝑢 ∈ 𝑉.
Hence 𝜎 is a constant function.
Remark 3.3:
The converse of the above theorem need not be true.
Example 3.4:
Consider 𝐺 ∗ = (𝑉, 𝐸) where 𝑉 = {𝑣1 , 𝑣2 , 𝑣3 } and 𝐸 = {𝑣1 𝑣2 , 𝑣1 𝑣3 }. Define 𝐺 = (𝜎 𝜇) by

𝜎(𝑣𝑖 ) = 0.5, i = 1, 2, 3 and 𝜇(𝑣1 𝑣2 ) = 0.1, 𝜇(𝑣1 𝑣3 ) = 0.2. Then 𝜎 is a constant function. But
𝑑(𝑣2 ) = 0.1 ≠ 0.2 = 𝑑(𝑣3 ). Also 𝑡𝑑(𝑣2 ) = 0.6 ≠ 0.7 = 𝑑(𝑣3 ). So G is neither regular nor
totally regular.
4. Conclusion:
In this paper, regular and totally regular fuzzy graphs are compared through various
examples. A necessary and sufficient condition under which they are equivalent is provided.
It would be interesting to do further research on this topic and to find (2, 𝑘) and (3, 𝑘) regular
and totally regular fuzzy graphs.
5. References:
[1] Bhattacharya, P., Some Remarks on Fuzzy Graphs, Pattern Recognition Letter 6(1987)
297-302.
[2] Bhutani, K.R., On Automorphism of fuzzy Graphs, Pattern Recognition Letters 12:413-
420,1991.
[3] Frank Harary, Graph Theory, Narosa ∕ Addison Wesley, Indian Student Edition, 1988.
[4] John N. Mordeson and Premchand S. Nair, Fuzzy Graphs and Hypergraphs, Physica –
verlag, Heidelberg 2000.
[5] Rosenfeld, A., Fuzzy Graphs, In: L.A. Zadeh, K.S.Fu, M.Shimura, Eds., Fuzzy Sets and
their Application, Academic Press (1975), 77-95.
A STUDY ON DOMINATION IN INTUTIONISTIC FUZZY
GRAPH
¹S.P. KAMALA, ²Dr. R.S. SHEEBA
II M.Sc. Mathematics, Sree Ayyappa College for Womens, Chunkankadai.
²Assistant professor P.G. Department of Mathematics, Sree Ayyappa College for
Womens, Chunkankadai.
Abstract:
In this paper, an attempt has been made to introduce cardinality of an intutionistic
fuzzy graph. Also, the definition of bipartite, complete bipartite, strong arc, strength of
connectedness, dominating set, domination number, independeset, independent
domination number, in intutionistic fuzzy graphs are given.
Keywords:
Cardinality of intutionistic fuzzy graph, dominating set, domination number,
independent set.
1.Introduction
The concept of domination in intutionistic fuzzy graph was investigated by A.
Somasundram, S. Somasundaram[4] presented the concept of independent domination,
total domination. K. T. Atanassov[1] introduce the concept of intutionistic fuzzy (IF)
relation and Intutionistic Fuzzy graphs (IFGs). R. Parvathi and M. G. Karunambigai [2]
gave the definition for IFG as a special case of IFGs defined by K.T.Atanassov and A.
Shannon[3]. Based on the definition of cardinality of an Institutionistic Fuzzy Set (IFS) in
Yan Luo [5], the cardinality of an IFG is defined. In this paper, we introduced dominating
set, domination number, independent set, total domination and total domination number in
IFGs.
2.Preliminaries
Definition 2.1:
Let u be the vertex in an IFG G = (V, E), then N(u) = {𝑣 ∶ 𝑣 ∈
𝑉 & (𝑢, 𝑣) 𝑖𝑠 𝑎 𝑠𝑡𝑟𝑜𝑛𝑔 𝑎𝑟𝑐 } is called neighbourhood of u.
Definition 2.2.
An arc (u, v) is said it to be a strong arc if 𝜇2 (𝑢, 𝑣 ) ≥ 𝜇2∞ (𝑢, 𝑣 ) and 𝛾2 (𝑢, 𝑣 ) ≥
𝛾2∞ (𝑢, 𝑣 ).
Definition 2.3.
Let G = (V, E) be an IFG on V, let u, v ∈ V we say that u dominates v in G if
there exists a strong arc between them.
Definition 2.4.
Let G = (V, E) be an IFG. A subset S of V is called a dominating set in G if for
every v ∈ V-S, there exists u ∈ S such that u dominates v.
Definition 2.5.
Let G = (V, E) be an IFG. Let S be the dominating set of G. The dominating set S
is called minimal dominating set, if no proper subset of S is a dominating set.
Definition 2.6.
Let G = (V, E) be an IFG. The lower domination number of G is defined as the
minimum cardinality among all minimal dominating set of G and it is denoted by d(G).
The upper domination number of G is defined as the minimum cardinality among all
minimal dominating set of G and it is denoted by D(G).
Definition 2.7.
Let G = (V, E) be an IFG. A vertex v ∈ V called an isolated vertex if 𝜇2 (𝑢, 𝑣 ) =
0 and 𝛾2 (𝑢, 𝑣 ) = 0 for all u, v ∈ V.
Definition 2.8.
Tow vertices in n IFG, G = (V, E) are said to be independent if there is no strong arc
between them that is 𝜇2 (𝑣1 , 𝑣2 ) < 𝜇2∞ (𝑣1 , 𝑣2 ) and 𝛾2 (𝑢, 𝑣 ) < 𝛾2∞ (𝑢, 𝑣 ).
Definition 2.9.
An Independent set S of G in an IFG is said to be maximal independent if for every
vertex v ∈ 𝑉-S, the set S⋃{𝑉 } is not independent.
Definition 2.10.
The minimum cardinality among all maximal independent set is called lower
independent number of G and it is denoted by i(G).
The maximal cardinality among all maximal independent set is called upper
independent number of G and it is denoted by I(G).
3. Main result
Theorem 3.1:
A dominating set D of an IFG, G = (V, E) is a minimal dominating set if and only if for
each d ∈ D one of the following conditions holds.
(i) d is not a strong neighbor of any vertex in D.
(ii) There is a vertex v ∈ V – D such that N(v) ∩ D = d.
Proof.
Assume that D is a minimal dominating set of G. Then for every vertex d ∈ D, D –
d is not a dominating set.
Hence there exists 𝑣 ∈ 𝑉 − (𝐷 − {𝑑 }) which is not dominated by any vertex in D
– {d}.
If v = d,
We get, v is not a strong neighbor of any vertex in D.
If v ≠ d,
We get, v is not dominated by D – {d}, but is dominated by D, then the vertex v is
strong neighbor only to d in D.
That is N(v) ∩ D = d.
Conversely,
Assume that D is dominating set and for each vertex d ∈ D, one of the two conditions
holds.
Suppose D is not a minimal dominating set, then there exists, a vertex d ∈ D,
D – {d} is a dominating set.
Hence d is a strong neighbor to atleast one verted D – {d}, condition one does not
hold.
If D – {d} is dominating set then every vertex in V – D is a strong neighbor to atleast
one vertex in D – {d}, the second condition does not hold.
Which is a contradiction to our assumption that atleast one of these condition holds.
So D is a minimal dominating set.
Theorem 3.2:
Let G = (V, E) be an IFG without isolated vertices and D is a minimal dominating set.
Then V – D is a dominating set of G.
Proof.
Let D be a minimal dominating set. Let v be any vertex of D.
Since G has no isolated vertices, there is a vertex d ∈ N(v).
v must be dominated by atleast one vertex in D – {v}, that is D – {v} is a dominating
set.
By Theorem 3.1, it follows that d ∈ V – D.
Thus, every vertex in D is dominated by atleast one vertex in V – D.
Theorem 3.3:
An independent set is a maximal independent set of IFG. G = (V, E)
if and only if it is important and dominating set.
Proof.
Let D be a maximal independent set in an IFG.
Hence, for every vertex v ∈ V – D, the set D ⋃ {v} is not independent.
For every vertex v ∈ V – D, there is a vertex u ∈ D such that u is a strong neighbor
to v.
Thus, D is a dominating and independent set.
Conversely,
Assume D is both independent and dominating.
Suppose D is not maximal independent, then there exists a vertex v ∈ V – D, the set
D ⋃ {v} is independent.
If D ⋃ {v} is independent then no vertex in D is strong neighbor to v.
Hence D cannot be dominating set, which is a contradiction to our assumption that
D is not maximal independent.
Hence D is maximal independent set.
Theorem 3.4:
Every maximal independent set in an IFG, G = (V, E) is minimal dominating set.
Proof.
Let S be a maximal independent set in an IFG.
By Theorem 3.3, S is a dominating set.
Suppose S is not a minimal dominating set, there exists atleast one vertex v ∈ S for
which S – {v} is a dominating set.
But if S – {v}dominates V – {S – (v)}, then atleast one vertex in S – {v} must be
strong neighbor to v.
This contradicts the fact that S is an independent set of G.
Therefore, S must be a minimal dominating set.
4. Conclusion
The concept of domination in graphs is very rich both in theoretical developments and
applications. In this paper, we have introduced the concept o dominating sets, independent
set, domination number and independent domination number for intuitionstic fuzzy graphs.
Some interesting properties of these new concepts are proved. Further, the authors
proposed to introduce vertex cover, edge domination, edge independence in IFGs and to
apply these concepts in network applications.
5. References
[1] K. Atanassov, Intutionistic Fuzzy Sets: Theory and Applications, Physica-Verlag,

New York (1999).
[2] M.G. Karunambigai and R.Parvathi, Intutionistic Fuzzy Graphs, Proceedings of 9th
Fuzzy Days International Conference on Computational Intelligence, Advances in soft
computing : Computational Intelligence, Theory and Applications, Springer-Verlag, 20
(2006), 139-150.
[3] A. Shannon and K. Atanassov, A first step to a theory of the intutionistic fuzzy
graphs, Proceedings of the 1st Workshop on Fuzzy Based Expert Systems (D, Lakov,
Ed.). Sofia, September 28-30, 1994, 59-61.
[4] A. Somasundaram and S.Somasundaram, Domination in Fuzzy Graphs-I, Pattern
Recognition Letters, 19 (1998), 787-791.
[5] Yan Luo and Changrui Yu, A Fuzzy Optimization Method for Multi-Criteria
Decision Making Problem Based on the Inclusion Degrees of Intutionistic Fuzzy Sets,
Journal of Information and computing Science, 3(2) (2008), 146-152.
A STUDY ON ONE MODULO THREE MEAN LABELING OF
GRAPHS
G.ABISHA1 and Dr.R.S.SURIYA2
1
II M.Sc Mathematics, Sree Ayyappa College for Women, Chunkankadai
2
Assistant Professor, PG Department of Mathematics,
Sree Ayyappa College for Women, Chunkankadai
Abstract:
The concept of mean labeling was induced by Somasundaram and Ponraj
[25]. Different kinds of mean labeling are further studied by Gayathri and Gopi
[9-17]. Swaminathan and Sekar [27] introduced the concept of one modulo
three graceful labeling. As an analogue Jayanthi and Maheswari [21] introduced
one modulo three mean labeling and proved that some standard graphs are one
modulo three mean graphs. Motivated by the work of these authors, in this
paper, we obtained some necessary conditions and properties for one modulo
three mean labeling. Also, we prove the converse part of theorems obtained in
[21], where only partial results are obtained.
Key words:
Mean labeling, Mean graphs, One modulo three mean labeling, one
modulo three mean graphs.

1.Introduction:
This paper deals with graph labeling. All graphs considered here are
simple, finite and undirected. The terms not defined here are used in the sense
of Harary [20].
The graph labeling is an assignment of integers to the vertices or edges
or both subject to certain conditions. If the domain of the mapping is the set of
vertices (or edges) then the labelling is called a vertex labeling (or an edge
labeling). By a graph G, we mean a graph G = ( ) with | | and
| | .
Graph labeling was first introduced in the late 1960’s. many studies in
graph labeling refer to Rosa’s research in 1967 [24]. Rosa introduced a function
from a set of vertices in a graph G to the set integers {0, 1, 2, 3, …}, so that
each edge is assigned the label | |, with all labels distinct, Rosa
called this labelling -valuation. Independently, Golomb studied the same type
of labeling and called this labelling as graceful labeling.
Labeled graphs serve as useful models for a broad range of applications
such as x-ray crystallography, radar, coding theory, astronomy, circuit design
and communication network addressing. Particularly, interesting applications of
graph labeling can be found in [2-5].
Somasundaram and Ponraj [25-26] have introduced the notation of mean
labeling of a graph. A graph G is said to have a mean labeling if there is

an injective function from the vertices of G to {0, 1, 2, 3, …, } such that
when each edge is labeled with if is even and
if is odd then the resulting edge labels are distinct. A
graph that admits a mean labeling is called a mean graph.
Vaidha [30-33] and et al. have investigated several familes of mean
graphs. Nagarajan [29] and et al. have found some new results on mean graphs.
Ponraj, Jayanthi and Ramya extended the notion of mean labeling to super mean
labeling in [23]. Gayathri and Tamilselvi [18-19, 28] extended super mean
labeling to -super mean, -super mean, -super edge mean and -
super edge mean labeling. Manikam and Marudai [22] introduced the concept to
-odd mean and -odd mean graphs.
Different kinds of mean labeling are studied by Gayathri and Gopi in
[9-17] Swaminathan and Sekar [27] introduced the concept of one modulo three
graceful labeling. As an analogue, Jayanthi and Maheswari [21] introduced one
modulo three mean labeling and proved that some standard graphs are one
modulo three mean graphs. Motivated by the work of these authors, in this
paper, we obtained some necessary conditions and properties for the one
modulo three mean labelling. Also, we prove the converse part of theorems
obtained in [21], where only partial results are obtained.

2. Main results:
Definition 2.1:
A graph G = is said to be one modulo three mean graph if there
is a function from the vertex set of G to the set
{0, 1, 3, 4, 6, 7,…, 3 3, 3 2} with is one-one and induces a bijection
from the edge set of G to the set {1, 4, 7, 10,…, 3 5, 3 2} where
⌈ ⌉ and the function is called as one modulo three mean
labeling of G. Here, ( ) 1 (mod 3) every edge in G.
Observations 2.2:
a) 3 2 for all
b) 3 2 is odd if is odd and
3 2 is even if is even
c) 3 2 {
d) 3 3 is even if is odd and
3 3 is odd if is even
e) 3 3 {
Theorem 2.3:
If a graph G is a one modulo three mean graph then 0 and 1 are vertex
labels.
Proof:
The induced edge label 1 can only be obtained by the adjacent vertex
label pair (0, 1). Therefore, 0 and 1 are ought to be vertex labels.
Theorem 2.4:
If a graph G = is a one modulo three mean graph, then 3 3 and
3 2 are ought to be the vertex labels.
Proof:
By definition 2.1, the number 3 2 has to be an edge label. In order to
have 3 2 as an induced edge label, the only possible vertex pair is
. Hence 3 3 and 3 2 are vertex labels.
Theorem 2.5:
Let G = be a one modulo three mean graphs with one modulo three
mean labeling . Let be the number of edges whose one vertex label is even
and the other is odd. Then ∑ where
denotes the degree of vertex .
Proof:
Since is one modulo three mean labelling of G, we have
⌈ ⌉
Now, ∑ (∑ )
2{ }
Hence, ∑ .
As an illustration, we consider the cycle graph
13 1
12 7
Figure 2.1
Define { } by
Clearly, is one modulo three mean labeling. Here .
Now,
Corollary 2.6:
If G = is a one modulo three mean graph with one modulo three
mean labeling , then ∑
Proof:
By theorem 2.5,
∑ (since )
∑ (since 1)
Hence the corollary.
Theorem 2.7:
Let G = be a -regular one modulo three mean graph with even.
Let be the number of edges whose one vertex label is even and other is odd
then is even.
Proof:
By theorem 2.5, ∑
G being -regular ∑
If is even then is even implies right hand side of is even. If is odd then
is even and is even implies right hand side of is even. Hence is
even.
Theorem 2.8:
Let G = be a one modulo three mean graph.
i. If is odd then cannot be the vertex labels of cycle
contained in G.
ii. If is even then cannot be the vertex labels of cycle
contained in G.
iii. If is odd then cannot be the vertex labels of cycle
contained in G.
iv. If is even then cannot be the vertex labels of cycle
contained in G.
Proof:
Let G be a one modulo three mean graph. Let be the vertices of
a cycle contained in G (see figure 2.2).

𝑎
𝑎 𝑎
Figure 2.2
i. Let be odd then by Observation 2.2(b), is odd. Suppose
be the vertex labels of the cycle contained in G (see figure
2.3). Then without loss of generality, assume
𝑎 𝑎
Figure 2.3
We know that, (since is odd)
(since is even)
In this case, the induced edge labels are

1
Which is a contradiction to G is one modulo three mean graph. Hence if, is
odd, then cannot be the vertex labels of the cycle contained in G.
ii. Let be even, then by observation 2.2(d), is odd. Suppose
be the vertex labels of the cycle contained in G (see figure
2.4). Then without loss of generality, assume
𝑎 𝑎
Figure 2.4
(since is even)
even, then cannot be the vertex labels of the cycle contained in
G.
iii. Let be odd, then by observation 2.2 and (d), is odd and
is even. Suppose be the vertex labels of the
cycle contained in G (see figure 2.5). Then without loss of generality,
assume
𝑎
𝑎 𝑎
Figure 2.5
(since is even)
=
=
= 3q 2
odd, then cannot be the cycle contained in G.
iv. Let be even, then by observation 2.2(b) and (d), is even and
is odd. Suppose be the vertex of the cycle
contained in G (see figure 2.6). Then without loss of generality, assume
𝑎 𝑎
Figure 2.6
(since is even)

=
= 3q 2
even, then cannot be the vertex labels of the cycle
contained in G.
Necessary Conditions
Theorem 2.9:
Let G be a connected one modulo three mean graph. Let be a vertex
with label . Let be any vertex adjacent to the vertex with label
a) If (mod 6) then (mod 6)
b) If (mod 6) then (mod 6)
c) If (mod 6) then (mod 6)
d) If (mod 6) then (mod 6)

Proof:
a) Let (mod 6)
By the definition of one modulo three mean labeling, it is clear that for any ,
(mod 6)
Claim 1: (mod 6)
On the contrary, suppose 3 (mod 6), then for
some , which implies . Since (mod 6),
for some .
Therefore, (since is odd)
(mod 3)
Which is a contradiction to f is a one modulo three mean labeling.
Therefore, (mod 6) 2)
Claim 2: (mod 6)
On the contrary, suppose (mod 6), then for
some , which implies . Since (mod 6),
for some .
Therefore, (since is even)
(mod 3)
Which is a contradiction to is one modulo three mean labeling.
Therefore, (mod 6)
Claim 3: (mod 6)
On the contrary, suppose (mod 6), then for some .
Since (mod 6), for some .
=
(mod 3)
Which is a contradiction to f is one modulo three mean labeling.
Therefore, 0 (mod 6)
From equations to we have, (mod 6)
Which proves (a).
b) Let (mod 6).
Then for some , which implies By the
definition of one modulo three mean labeling, it is clear that for any ,
(mod 6)
Claim 1: (mod 6)
some , which implies Now, .
=
(mod 3)
Therefore, (mod 6)
Claim 2: (mod 6)
(mod 3)
Therefore, (mod 6)
Which proves (b).
c) Let (mod 6).
definition of one modulo three mean labeling, it is clear that for any
(mod 6)
Claim 1: (mod 6)
Now,
Therefore (since is odd)
(mod 3)
Which is contradiction to f is one modulo three mean labeling.
Therefore, (mod 6)
Claim 2: (mod 6)
some , which implies . Now,
(mod 3)
Therefore, (mod 6)
Claim 3: (mod 6)
=
=
(mod 3)
Therefore, (mod 6)
Which proves (c).
d) Let (mod 6)
definition of one modulo three mean labeling, it is clear that for any
(mod 6)
Claim 1: (mod 6)
Now,
=
(mod 3)
Therefore, (mod 6)
Claim 2: (mod 6)
some , which implies . Now,
(mod 3)
Therefore, (mod 6)
Which proves (d).
Theorem 2.10:
If G is a connected one modulo three mean graph, then all its vertices
receive labels as either 0 (or) 1 (mod 6).
Proof:
Let G be a one modulo three mean graph. Then by theorem 2.3, 0 and 1
are vertex labels. Now, by theorem 2.9 (a) and (b), all the vertex labels are of
either 0 (or) 1 (mod 6).
Theorem 2.11:
If G = is a connected one modulo three mean graph, then is odd.
Proof:
Let G = be a one modulo three mean graph. Then by theorem 2.4,
is a vertex label.
Claim: is odd
Suppose is even, then by observation 2.2(c), (mod 6).
Which is a contradiction to theorem 2.10. Therefore, is odd.

Corollary 2.12:
If G is connected graph with even, then it is not a one modulo three mean
graph.
Proof:
Let G is a connected one modulo three mean graph and is even. Then
by theorem 2.4, is a vertex label.
Claim: is not a one modulo three mean graph
Since is even, then by observation 2.2(c), (mod 6). By
theorem 2.10, is not a one modulo three mean graph.
Theorem 2.13:
If G = is a tree of odd order, then it is not a one modulo three mean
graph.
Proof:
Suppose G = be a one modulo three mean tree of odd order, then
is odd implies = 1 is even. Which is contradiction to q is odd. Therefore,
is not a one modulo three mean tree.
Theorem 2.14:
If G is a unicyclic connected graph with even, then it is not a one
modulo three mean graph.

Proof:
Let G is a unicyclic connected one modulo three mean graph with even.
Then by theorem 2.4, is a vertex label.
Claim: is not a one modulo three mean graph
Since is even, then by observation 2.2(c), (mod 6). By
theorem 2.10, is not a one modulo three mean graph.
Theorem 2.15:
If G is a connected one modulo three mean graph of odd size and then
. Where is the maximum degree of a vertex in G.
Proof:
Let G is a connected one modulo three mean graph of odd size then by
theorem 2.11, is odd and by theorem 2.10, all the vertex labels are congruent
to either 0 (or) 1 (mod 6). That is, G contains vertex labels from the set
{0, 6, 12, … , 3q – 3} or {1, 7, 13, … , 3q – 2}.
Hence, +1 (or) +1
Thus, .
References:
[1] K. Amuthavalli, Graph labeling and it’s Application’s some generalizations
of odd mean labeling, Ph.D. Thesis, Mother Theresa Women’s University,
Kodaikanal, July (2010).
[2] G.S. Bloom and S.W. Golomb, Applications of numbered undirected graphs,
Proc. IEEE, 65 (1977) 562-570.
[3] G.S. Bloom and S.W. Golomb, Numbered complete graphs, unusual rulers
and assorted applications, in Theory and Applications of Graphs, Lecture Notes
in Math., 642, Springer-Verlag, New York (1978) 53-65.
[4] G.S. Bloom and D.F. Hsu, On graceful digraphs and a problem in network
addressing, Congressus Numerantium, 35 (1982) 91-103.
[5] J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal
of Combinatorics, 17 (2014) #DS6.
[6] B. Gayathri and K. Amuthavalli, k-odd mean labeling of Crown graphs,
International Journal of Mathematics and Computer Science, 2(3) (2007)
253-259.
[7] B. Gayathri and K. Amuthavalli, (k,d)-odd mean labeling of some graphs,
Bulletin of Pure and Applied Sciences, 26E(2) (2007) 263-267.
[8] B. Gayathri and K. Amuthavalli, k-odd mean labeling of 〈 〉, Acta
Ciencia Indica, 34(2) (2008) 827-834.
[9] B. Gayathri and R. Gopi, k-even mean labeling of , International
Journal of Engineering Sciences, Advanced Computing and
Bio-Technology, Vol. 1, No. 3, July-September 2010, P. No. 137-145.
[10] B. Gayathri and R. Gopi, k-even mean labeling of , Acta Ciencia
Indica, Vol. XXXVII, No. 2, 291-300, 2011.
[11] B. Gayathri and R. Gopi, k-even mean labeling of , Elixir
International Journal of Applied Sciences, No. 36, 2011, P.No. 3102-3105.
[12] B. Gayathri and R. Gopi, k-even mean labelling of , International
Journal of Engineering Science, Advanced computing and Bio-Technology,
Vol. 2, April-June 2011, P.No. 77-87.
[13] B. Gayathri and R. Gopi, International Conference on Mathematics and
Computer Science, k-even mean labelling of ̅̅̅̅, Loyola College,
Chennai, January 7-8, 2011, Proc. P. No. 519-524.
[14] B. Gayathri and R. Gopi, (k,d)-even mean labeling of ,
International Journal of Mathematics and Soft Computing, Vol. 1, No. 1, 17-23,
August 2011.
[15] B. Gayathri and R. Gopi, k-even mean labeling of some graphs, Heber
International Conference on Applications of Mathematics and Statistics, Bishop
Heber College (Autonomous), January 5-7, 2012 Proc. P. No. 420-425.
[16] B. Gayathri and R. Gopi, k-even mean labeling of some trees, International
Conference on Mathematics in Engineering and Business Management, Stella
Mary’s College (Autonomous), Chennai, March 9-10, 2012, Proc. P. No. 99-
102.
[17] R. Gopi, A Study on Different kinds of Mean labeling, Ph.D. Thesis,
Bharathidasan University, Trichy, February (2013).
[18] B. Gayathri, M. Tamilselvi and M. Duraisamy, (k,d)-super mean labeling
of some graphs, International Journal of Mathematics and Computer Science,
2(3) (2007) 245-252.
[19] B. Gayathri and M. Tamilselvi, k-super mean labeling of some trees and
cycle related graphs, Bulletin of Pure and Applied Sciences, Volume 26E(2)
(2007) 303-311.
[20] F. Harary, Graph Theory, Addison Wesley Reading Massachusetts, 1972.
[21] P. Jeyanthi and A. Maheswari, One Modulo Three Mean Labeling of
Graphs, Amer. J. Appl. Math. and Stat., 2(5) (2014) 302-306.
[22] K. Manickam and M. Marudai, Odd mean labelings of graphs, Bulletin of
Pure and Applied Sciences, 25E(1) (2006) 149-153.

[23] R. Ponraj, P. Jayanthi and D. Ramya, On super mean graphs of order 5,
Bulletin of Pure and Applied Sciences, 25E (2006) 143-148.
[24] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs
(Internat. Symposium, Rome, July 1966), Gordon and Breach, N.Y. and Dunod
Paris (1967) 349-355.
[25] S. Somasundaram and R. Ponraj, Mean labelings of graphs, National
Academy Science Letter, 26 (2003)10-13.
[26] S. Somasundaram and R. Ponraj, Non-existence of mean labeling for a
wheel, Bull. Pure and Appl. Sciences(Mathematics & Statistics), 22E (2003)
103-111.
[27] V. Swaminathan and C. Sekar, Modulo three graceful graphs, Proceed.
National Conference on Mathematical and Computational Models, PSG College
of Technology, Coimbatore, 2001, 281-286.
[28] M. Tamilselvi, A Study in Graph Theory-Generalization of super mean
labeling, Ph.D. Thesis, Vinayaka Mission University, Salem, August (2011).
[29] R. Vasuki and A. Nagarajan, Further results on mean graphs, Scientia
Magna, 6(2) (2010) 26-39.
[30] S.K. Vaidya and Lekha Bijukumar, Mean labeling for some new families
of graphs, Journal of Pure and Applied Sciences, 1(18) (2010) 115-116.

[31] S.K. Vaidya and Lekha Bijukumar, Some new families of mean graphs,
Journal of Mathematics Research, 2(3) (2010) 169-176.
[32] S.K.Vaidya and Lekha Bijukumar, New mean graphs, International J.
Math. Combin., 3 (2011) 107-113.
[33] S.K. Vaidya and Kanani, Some new mean graphs, International Journal of
Information Science and Computer Mathematics, 1(1) (2010) 73-80.

A STUDY ON PRIME GRACEFUL LABELING OF SOME
GRAPHS
SAJITHA C. S¹, Dr. R. S. SHEEBA²
¹II M.Sc. Mathematics, Sree Ayyappa College for Women, Chunkankadai.

²Assistant Professor, P.G. Department of Mathematics, Sree Ayyappa College for Women,
Chunkankadai.
Abstract:
A Graph G with m vertices and n edges, is said to be prime graceful labeling if there is
an injection f from the vertices of G to {1, 2, 3, ..., k} where k = min {2m, 2n} such that
gcd (𝑓(𝑣1 ), 𝑓(𝑣2 )) = 1 and the induced injection function 𝑓 ∗ from the edges of G to
{1, 2,.., k} is defined by 𝑓 ∗ (𝑣1 𝑣2 ) = |𝑓(𝑣1 ) − 𝑓(𝑣2 )|, the resulting edge labels are distinct. In
this paper star 𝐾1,𝑛 , bistar 𝐵𝑛,𝑛 , path 𝑃𝑛 , cycle 𝐶𝑛 , 𝐾𝑚,2 are shown to be prime graceful graphs.
Keywords:
Prime labeling, Graceful labeling, Prime graceful labeling, Bistar graph, Cycle.
1. Introduction:
A graph labeling is an assignment of integers to the vertices or edges or both subject to
certain conditions. If the domain of the mapping is a set of vertex (edge/total) then the labeling
is called a vertex (edge/total) labeling. Rosa [1] introduced β-valuation of a graph. Golomb [2]
called it as graceful labeling. J.A. Gallian [3] studied a complete survey on graph labeling. In
this paper, the concept of Prime Graceful labeling is introduced and some results on these are
established.
2. Preliminaries:
Definition 2.1:
Let 𝐺 = (𝑉(𝐺), 𝐸(𝐺)) be a graph with m vertices. A bijection 𝑓: 𝑉→{1, 2, . . . , 𝑚} is
called a prime labeling if for each edge 𝑒 = 𝑢𝑣, gcd (𝑓(𝑢), 𝑓(v)) = 1. A graph which admits
a prime labeling is called Prime graph.
Definition 2.2:
Let 𝐺 = (𝑉(𝐺), 𝐸(𝐺)) be a simple, finite and undirected graph with 𝑉 = |𝑚| and
𝐸 = |𝑛|. An injection function 𝑓: 𝑉→{1, 2, . . . , 𝑚} is called a graceful labeling of G if all the
edge labels of G given by 𝑓(𝑢𝑣) = |𝑓(𝑢) − 𝑓(𝑣)| for every uv ∈ E are distinct. A graph which
admits a graceful labeling is called a Graceful graph.
Definition 2.3:
A Graph G with m vertices and n edges, is said to be prime graceful labeling if there is
an injection f from the vertices of G to {1, 2, 3, .., k} where k = min{2m, 2n} such that
gcd (𝑓(𝑣1 ), 𝑓(𝑣2 )) = 1 and the induced injection function 𝑓 ∗ from the edges of G to
{1, 2, ..., k} is defined by 𝑓 ∗ (𝑣1 𝑣2 ) = |𝑓(𝑣1 ) − 𝑓(𝑣2 )|, the resulting edge labels are distinct.
3. Main Results:
Theorem 3.1
The star 𝐾1,𝑛 admits prime graceful labeling
Proof:
The star graph 𝐾1,𝑛 has n vertices and n+1 edges.
𝑘 = min{2(𝑛+1), 2𝑛}
= 2n
In 𝐾1,𝑛 one vertex is adjacent with remaining n vertices. Label the vertex of degree n with one,
remaining with 2, 3, …, n, n + 1. The gcd of end vertices of each edge is 1. Therefore, the
labels 1, 2, 3, … are distinct.
Theorem 3.2
The Bistar graph 𝐵𝑛,𝑛 admits prime graceful labeling.
Proof:
The Bistar graph has (2𝑛 + 2) vertices and (2𝑛 + 1) edges.
𝑘 = min {2(2𝑛+2), 2(2𝑛+1)}
= 2(2𝑛 + 2)
Bistar graph 𝐵𝑛,𝑛 has exactly two vertices of degree n, label these vertices by 1 and 3. Label
the vertices that are adjacent with vertex label 1 by 2, 4, 5,.…, (𝑛 + 2), so that gcd of end
vertices of each edge is one. Label the vertices that are adjacent with vertex label 3 from the
set {𝑛 + 2, 𝑛 + 3, . . . , 2(2𝑛 + 2)} and not a multiple of 3. The gcd of end vertices of each
edge is 1 and labels are distinct.
Theorem 3.3
The path 𝑃𝑛 admits prime graceful labeling
Proof:
The path 𝑃𝑛 has n vertices and (𝑛 − 1) edges.
𝑘 = min {2𝑛, 2(𝑛 − 1)}
= 2n-1
The vertices of 𝑃𝑛 are labeled from the set 𝑆 = {1, 2, ..., 2𝑛-3, 2𝑛-2}.
𝑛 𝑡ℎ
If n is even, choose (2) vertex and label it with 1.
𝑛+1 𝑡ℎ
If n is odd, choose ( ) vertex and label it with 1.
2
Choose last two integers from the set S. That is, (2𝑛 − 3) and (2𝑛 − 2) and label it to the
adjacent vertices of vertex label 1. Choose two integers from the beginning of the set S and
label with the vertex adjacent to the vertex label 2𝑛-3 and 2𝑛-2, so that the gcd of two
consecutive vertices is 1. Alternatively choose the integer from the beginning the set and end
of the set, so that the gcd of two consecutive vertices is 1. The resulting edge labels are distinct.
Theorem 3.4
The cycle graph 𝐶𝑛 admits prime graceful labeling.
Proof:
The cycle 𝐶𝑛 has n edges and n vertices.
𝑘 = min {2𝑛, 2𝑛}
= 2n
The vertices of 𝐶𝑛 are labeled from the set 𝑆 = {1, 2, 3, . . . , 2𝑛 − 1, 2𝑛}. Choose an arbitrary
vertex in 𝐶𝑛 and label it with 1. Choose last two integers from the set S. That is, 2𝑛 − 1 and
2𝑛 label it to the adjacent vertex label 1. Choose the integers from the beginning of the set S
and label with the vertex adjacent to the vertex label to the vertex label 2𝑛 − 1 or 2𝑛, so that
the gcd of two consecutive vertices is 1 and edge labels are distinct.
Theorem 3.5
The graph 𝐾𝑚,2 admits prime graceful labeling.
Proof:
The graph 𝐾𝑚,2 contains (𝑚 + 2) vertices and 2m edges.
k = min {2(𝑚 + 2), 2(2𝑚)}
= min {2𝑚 + 4, 4𝑚}
= 2m + 4
Label the vertices having degree m of 𝐾𝑚,2 with 1 and 2, remaining vertices with odd numbers
3, 5, …., [(2𝑚 + 4) − 1]. Hence the gcd of two consecutive vertices of each edge is 1 and
resulting edge labels are distinct.
4. Conclusion:
In this paper the concept of prime graceful labeling is introduced and prove the
existence of prime graceful labeling for graphs such as star 𝐾1,𝑛 , bistar 𝐵𝑛,𝑛 , path 𝑃𝑛 , cycle 𝐶𝑛 ,
𝐾𝑚,2 . It would be interesting to do further research on this topic and to find more graphs that
satisfy the prime graceful labeling.
5. Reference:
[1] A. Rosa, On Certain Valuations of the Vertices of a Graph, Theory of Graph, (International
Symposium, Rome, July 1966), Gorden, Breach. N.Y. and Dunad, Paris (1967), 349-355
[2] S.W. Golomb, How to Number a Graph in Graph theory and Computing, R.C. Read, Ed.,
Academic Press, New York (1972), 23-37.
[3] Gallian JA, “A dynamic survey of graph labeling”, The electronic journal of combinatory,
Vol.16, No.6, (2009), pp.1-219.
[4] Bondy JA & Murthy USR, “Graph theory with applications”, Elsevier North Holland. New
York, (1976).
[5] Tout R, Dabboucy AN & Howalla K, “Prime labeling of graphs”, National Academy
Science Letters-India, Vol.5, No.11, (1982), pp.365-368.
[6] Uma R & Murugesan, N, “Graceful labeling of some graphs and their sub graphs”, Asian
Journal of Current Engineering and Maths, Vol.1, No.6, (2013), pp.307-370.
A STUDY ON S𝜶RW CLOSED MAPS IN TOPOLOGICAL
SPACES
S.R.RESHMA1 and Dr. R.S.SURIYA2

1
2
Abstract
In this paper, we introduce and studies a new class of closed maps is called
s𝛼rw-closed maps in topological space. Also some of their properties have been
investigated. We also introduce s𝛼rw*-closed maps in topological spaces and
study of their properties.
2010 Mathematics Classification: 54A05, 54A10
Key words:
s𝛼rw-closed maps, s𝛼rw*-closed maps
Introduction:
In 1982, the concept of generalized closed map are introduced and studied by
S. R. Malghan[22], wg-closed maps and rwg-closed maps were introduced and
studied by Nagaveni[25], Later regular closed maps, rw-closed maps and
𝛼rw-closed maps have been introduced and studied by Long[19], Benchalli[8]
and R. S. Wali[34] respectively. The aim of this paper is to introduce and study
s𝛼rw-closed, s𝛼rw*-closed maps in topological spaces. Also some of their
properties have been investigated.
Preliminaries:
In this paper X or (𝑋, 𝜏) and Y or (𝑌, 𝜎)denote topological spaces on which no
separation axioms are assumed. For a subset A of a topological space X, cl(A),
int(A), X – A or AC represent closure of A, interior of A and complement of A
in X respectively.
Definition: 1.1
A subset A of a topological space (𝑋, 𝜏) is called
i. regular closed set if A = cl (int (A))
ii. semi-pre closed set if int (cl(int(A))) ⊆ A.
iii. 𝛼-closed set if cl(int(cl(A))) ⊆ A.
iv. Pre-closed set if cl(int(A)) ⊆ A.
v. Semi-closed set if int(cl(A)) ⊆ A.
Definition: 1.2
Let A be subset of topological space (𝑋, 𝜏), A defined semi 𝛼-regular weakly
closed set whenever scl(A) ⊆ U and A ⊆ U where U be 𝛼rw-open in X. The
family of all semi 𝛼-regular weakly closed set in (𝑋, 𝜏), is denoted by
s𝛼rw C(X).
Definition: 1.3
A map f: (𝑋, 𝜏) → (𝑌, 𝜎) is said to be
i. 𝛼-closed map if f(F) is 𝛼-closed in Y for every closed subset F of X.
ii. gspr-closed map if f(F) is gspr-closed in Y for every closed subset F of X.
iii. g-closed map if f(F) is g-closed in Y for every closed subset F of X.
iv. rps-closed map if f(F) is rps-closed in Y for every closed subset F of X.
v. gprw-closed map if f(F) is gprw-closed in Y for every closed subset F of
X.
vi. swg-closed map if f(F) is swg-closed in Y for every closed subset F of X.
vii. rgw-closed map if f(F) is rgw-closed in Y for every closed subset F of X.
viii. regular-closed map if f(F) is regular-closed in Y for every closed subset F
of X.
ix. wg-closed map if f(F) is wg-closed in Y for every closed subset F of X.
x. rwg-closed map if f(F) is rwg-closed in Y for every closed subset F of X.
xi. gs-closed map if f(F) is gs-closed in Y for every closed subset F of X.
xii. gp-closed map if f(F) is gp-closed in Y for every closed subset F of X.
xiii. gpr-closed map if f(F) is gpr-closed in Y for every closed subset F of X.
Lemma: 1.4
i. Every closed set is s𝛼rw-closed set in X.
ii. Every regular-closed set is s𝛼rw-closed set in X.
iii. Every 𝛼-closed set is s𝛼rw-closed set in X.

iv. Every s𝛼rw-closed set is sg-closed set.
v. Every s𝛼rw-closed set is gsp-closed set.
vi. Every s𝛼rw-closed set is rsp-closed set.
vii. Every s𝛼rw-closed set is gs-closed set.
viii. Every s𝛼rw-closed set is gspr-closed set.
Remark: 1.5
i. Contra closed map if f(F) is open in y for every closed set F of X.
ii. Contra regular closed map if f(F) is r-open in y for every closed set F of
X.
iii. Contra semi-closed map if f(F) is s-open in y for every closed set F of X.
iv. Contra w-closed map if f(F) is w-open in y for every closed set F of X.
Lemma: 1.6
If a subset A of a topological space, and
i. If A is regular open and s𝛼rw-closed then A is 𝛼-closed set in X.
ii. If A is open and 𝛼g-closed then A is s𝛼rw-closed set in X.
iii. If A is open and gp-closed then A is s𝛼rw-closed set in X.
iv. If A is regular open and gpr-closed then A is s𝛼rw-closed set in X.
v. If A is open and wg-closed then A is s𝛼rw-closed set in X.
vi. If A is regular open and rwg-closed then A is s𝛼rw-closed set in X.
vii. If A is regular open and 𝛼gr-closed then A is s𝛼rw-closed set in X.
viii. If A is regular open and w𝛼-closed then A is s𝛼rw-closed set in X.

Remark: 1.7
If A ⊆ X is s𝛼rw-closed then s𝛼rw-cl A = A.
Definition: 1.8
A topological space (𝑋, 𝜏) is called
i. T1/2 space if every g-closed set is closed.
ii. Tsαrw space if every s𝛼rw- closed set is closed.
2. semi 𝜶-regular weakly closed maps:
Definition: 2.1
A map f: (𝑋, 𝜏) → (𝑌, 𝜎) is said to be semi 𝛼-regular weakly closed if the
image of every closed set in (𝑋, 𝜏) is s𝛼rw- closed in (𝑌, 𝜎).
Theorem: 2.2
Every closed map is s𝛼𝑟𝑤- closed map, but not conversely.
Proof:
Let f: (𝑋, 𝜏) → (𝑌, 𝜎) be closed map and F be any closed set in X. Then f(𝐹 ) is
closed set in Y. By lemma 1.4(i), every closed set is s𝛼rw- closed set. Hence
f(𝐹 ) is s𝛼rw-closed set in Y. Therefore f is s𝛼rw-closed.
Example: 2.3
Let X = Y = {a, b, c} 𝜏 = {X, 𝜙, {𝑎}, {b}, {a, b}} be a topology on X.
τ = {Y, ϕ, {a}, {b, c}} be a topology on Y. Let f: (𝑋, 𝜏) → (𝑌, 𝜎), define by
f(a) = b, f(b) = c, f(c) = a then f is s𝛼rw-closed map but not closed as image of
closed set {b, c} in X is {a, c}, which is not closed set in Y.

Theorem: 2.4
Every 𝛼- closed map is s𝛼rw-closed map, but not conversely.
Proof
Let f:(𝑋, 𝜏) → (𝑌, 𝜎) be 𝛼-closed map and F be any closed set in X. Then f(𝐹)
is closed set in Y. But by lemma 1.4(ii), every 𝛼-closed set is s𝛼rw-closed set.
Hence f(𝐹) is s𝛼rw- closed set in Y. Therefore f is s𝛼rw-closed.
Example: 2.5
Let X = Y = {a, b, c} 𝜏 ={X, ϕ, {a}, {b}, {a, b}} be a topology on X.
τ ={Y, ϕ, {a}, {b, c}} be a topology on Y. Let f: (𝑋, 𝜏) → (𝑌, 𝜎), defined by
closed set {b, c} in X is {a, c}, which is not 𝛼-closed set in Y. Therefore f is
not 𝛼-closed map in Y.
Theorem: 2.6
Every regular closed map is s𝛼rw- closed map, but not conversely.
Proof:
Let f: (𝑋, 𝜏) → (𝑌, 𝜎) be a regular closed map and F be any closed set in X.
Then f(𝐹) is regular closed set in Y. But by lemma 1.4(iii), every regular closed
set is s𝛼rw-closed set. Hence f(𝐹) is s𝛼rw- closed set in Y. Therefore f is
s𝛼rw-closed map.
Example: 2.7
Let X = Y = {a, b, c} 𝜏 = {X, ϕ, {a}, {b},{a, b}} be a topology on X.
𝜏 = {Y, ϕ, {b, c}} be a topology on Y. Let f: (𝑋, 𝜏) → (𝑌, 𝜎), defined by
closed set {b, c} in X is {a, c} which is not regular closed set in Y. Therefore f
is not regular closed map in Y.
Theorem: 2.8
Every s𝛼rw-closed map is sg-closed map, but not conversely.
Proof:
Let f: (𝑋, 𝜏) → (𝑌, 𝜎) be a s𝛼rw-closed map and F be any closed set in X. Then
f(𝐹 ) is s𝛼rw-closed set in Y. But by lemma 1.4(iv), every s𝛼rw-closed set is
sg-closed set. Hence f(𝐹) is sg-closed set in Y. Therefore f is sg-closed map.
Example: 2.9
Let X = Y = {a, b, c} 𝜏 = {X, ϕ, {a}, {b, c}} be a topology on X.
τ = {Y, ϕ, {a}, {b}, {a, b}, {a, c}} be a topology on Y. Let f: (𝑋, 𝜏) → (𝑌, 𝜎)
defined by f(a) = c, f(b) = a, f(c) = b then f is sg-closed map but not s𝛼rw-closed
as image of closed set {b, c} in X is {a, c}, Which is not s𝛼rw-closed set in Y.
Therefore f is not s𝛼rw-closed map in Y.
Theorem: 2.10
Every s𝛼rw- closed map is gs closed map, but not conversely.

Proof:
f(𝐹 ) is s𝛼rw-closed set in Y. But by lemma 1.4(v), every s𝛼rw-closed set is
gs-closed set. Hence f(𝐹) is gs-closed set in Y. Therefore f is gs-closed map.
Example: 2.11
Let X = Y = {a, b, c} τ = {X, ϕ, {a}, {b, c}} be a topology on X.
τ = {Y, ϕ, {a}, {b}, {a, b}, {a, c}} be a topology on Y. Let f: (𝑋, 𝜏) → (𝑌, 𝜎)
defined by f(a) = c, f(b) = a, f(c) = b then f is gs-closed map but not
s𝛼rw-closed as image of closed set {b, c} in X is {a, c}, which is not
s𝛼rw-closed set in Y. Therefore f is not s𝛼rw- closed map in Y.
Theorem: 2.12
Every s𝛼rw- closed map is rps closed map, but not conversely.
Proof:
Let f: (𝑋, 𝜏) → (𝑌, 𝜏) be a s𝛼rw- closed map and F be any closed set in X. Then
f(𝐹 ) is s𝛼rw-closed set Y. But by lemma 1.4(vi), every s𝛼rw-closed set is
rps-closed set. Hence f(𝐹) is rps-closed set in Y. Therefore f is rps-closed map.
Example: 2.13
𝜏 = {Y, ϕ, {a}, {b}, {a, b}, {a, c}} be a topology on Y. Let f: (𝑋, 𝜏) → (𝑌, 𝜎)
defined by f(a) = c, f(b) = a, f(c) = b then f is rps closed map but not
s𝛼rw-closed as image of closed set {b, c} in X is {a, c} ,which is not
s𝛼rw-closed set in Y. Therefore f is not s𝛼rw-closed map in Y.
Theorem: 2.14
Every s𝛼rw-closed map is gsp closed map, but not conversely.
Proof:
f(𝐹 ) is s𝛼rw-closed set in Y. But by lemma 1.4(vii) every s𝛼rw-closed set is
gsp-closed set. Hence f(F) is gsp closed set in Y. Therefore f is gsp-closed map
in Y.
Example: 2.15
Let X = Y = {a, b, c} 𝜏 = {X, ϕ, {a}, {b, c}} a topology on X.
defined by f(a) = c, f(b) = a, f(c) = b then f is gsp closed map but not
s𝛼rw-closed as image of closed set {b, c} in X is {a, c},which is not s𝛼rw
closed set in Y. Therefore f is not s𝛼rw-closed map in Y.
Theorem: 2.16
Every s𝛼rw-closed map is gspr closed map, but not conversely.
Proof: Let f: (𝑋, 𝜏) → (𝑌, 𝜎) be a s𝛼rw-closed map and F be any closed set in
X. Then f(𝐹) is s𝛼rw-closed set in Y. But by lemma 1.4(viii), every
s𝛼rw- closed set is gspr-closed set in Y. Therefore f is gspr-closed map in Y.

Example: 2.17
defined by f(a) = c, f(b) = a, f(c) = b then f is gspr closed map but not
s𝛼rw-closed as image of closed set {b, c} in X is {a, c}, which is not
s𝛼rw closed set in Y. Therefore f is not s𝛼rw-closed map in Y.
Remark: 2.18
The following examples show that s𝛼rw-closed map are independent of
pre-closed, 𝛽-closed, gp-closed, gpr-closed, swg-closed, rwg-closed,
wg-closed, rgw-closed, gprw-closed, pgpr-closed map.
Example: 2.19
Let X = {a, b, c} and Y = {a, b, c, d}, 𝜏 = {X, ϕ, {a}, {a, b}, {a, c}} be a
topology on X. 𝜏 = {𝑌, 𝜙, {a}, {b, c}, {a, b, c}} be a topology on Y. Let
f:(𝑋, 𝜏) → (𝑌, 𝜎) defined by f(a) = c, f(b) = a, f(c) = b then f is of pr–closed,
𝛽-closed, gp-closed,gpr-closed, swg-closed, rwg-closed, wg-closed, rgw-closed,
gprw-closed, pgpr-closed map. But f is not s𝛼rw-closed map as closed set {c} in
X is {b}, which is not s𝛼rw-closed set in Y. Therefore f is not s𝛼rw-closed map
in Y.
Example: 2.20: Let X = {a, b, c} and Y = {a, b, c, d} 𝜏 = {X, ϕ, {a}, {b}, {a,
b}, {a, c}} be a topology on X. 𝜏 = {Y, ϕ, {a}, {b, c}, {a, b, c}} be a topology
on Y. Let f: (𝑋, 𝜏) → (𝑌, 𝜎) defined by f(a) = c, f(b) = a, f(c) = b then f is
s𝛼rw-closed, but not a pre-closed, 𝛽-closed, gp-closed, gpr-closed, swg-closed,
rwg-closed, wg-closed, rgw-closed, gprw-closed, pgpr-closed as closed set
{a, c} in X is {b, c}, which is not pre-closed (respectively 𝛽-closed, gp-closed,
gpr-closed, swg-closed, rwg-closed, wg-closed, rgw-closed, gprw-closed,
pgpr-closed) set in Y.
Remark: 2.21
From the above discussion and known facts, the relation between s𝛼rw-closed
map and existing closed map in topological space is shown in the following
figure.
pre-closed, β-closed map, gp-closed map, gpr-closed map,

swg-closed map, rwg-closed map, wg-closed map,
gprw-closed map, rgw-closed map, pgpr- closed map
Regular
closed map α-closed map sαrw-closed
closed map map
sg-closed map
gs-closed map
rps-closed map
gsp-closed map
gspr-closed map
A B means the closed map A implies the closed map B.
A B means the closed map A and B are independent of each other.
Theorem: 2.22
If a map f: (𝑋, 𝜏) → (𝑌, 𝜎) is contra regular closed and 𝛼gr-closed map then f is
s𝛼rw closed map.
Proof:
Let F be any closed set in (𝑋, 𝜏). By remark 1.5 (ii), f(F) is regular open and
since 𝛼gr-closed, then by lemma 1.6(vii), f(F) is s𝛼rw-closed set in (Y, 𝜎).
Therefore f is s𝛼rw-closed map.
Theorem: 2.23
If a map f: (𝑋, 𝜏) → (𝑌, 𝜎) is contra w-closed and w𝛼-closed map then f is
s𝛼rw closed map.
Proof:
Let F be any closed set in (𝑋, 𝜏). By remark 1.5(iv), f(F) is w-open and since
w𝛼-closed, then by lemma 1.6(viii), f(F) is s𝛼rw-closed in (Y, 𝜎). Therefore
s𝛼rw closed map.
Theorem: 2.24
If a map f: (𝑋, 𝜏) → (𝑌, 𝜎) is contra closed and 𝛼g-closed map then f is
s𝛼rw closed map.

Proof:
Let F be any closed set in (𝑋, 𝜏). By remark 1.5(i), f(F) is open and since
𝛼g-closed, then by lemma 1.6(ii), f(F) is s𝛼rw closed in (Y, 𝜎). Therefore f is
s𝛼rw closed map.
Theorem: 2.25
If a map f: (𝑋, 𝜏) → (𝑌, 𝜎) is contra regular closed and rwg-closed map then f is
s𝛼rw closed map.
Proof:
Let F be any closed set in (𝑋, 𝜏). By remark 1.5(ii), f(F) is regular open and
since rwg-closed, then by lemma 1.6(vi), f(F) is s𝛼rw closed in (Y, 𝜎).
Therefore f is s𝛼rw closed map.
Theorem: 2.26
If a map f: (𝑋, 𝜏) → (𝑌, 𝜎) is contra closed and wg-closed map then f is
s𝛼rw closed map.
Proof:
Let F be any closed set in (𝑋, 𝜏). By remark 1.5(i), f(F) is open and since
wg-closed, then by lemma 1.6(v), f(𝐹) is s𝛼rw closed in (𝑌, 𝜎). Therefore f is
s𝛼rw closed map.

Theorem: 2.27
If a map f: (𝑋, 𝜏) → (𝑌, 𝜎) is contra regular closed and gpr-closed map then f is
s𝛼rw closed map.
Proof:
Let F be any closed set in (𝑋, 𝜏). By remark 1.5 (ii), f(𝐹) is regular open and
since gpr-closed, then by lemma 1.6(iv), f(𝐹) is s𝛼rw closed in (𝑌, 𝜎).
Therefore f is s𝛼rw closed map.
Theorem: 2.28
If a map f: (𝑋, 𝜏) → (𝑌, 𝜎) is contra closed and gp-closed map then f is
s𝛼rw closed map.
Proof: Let F be any closed set in (𝑋, 𝜏). By remark 1.5(i), f(𝐹) is open and
since gp-closed, then by lemma 1.6(iii), f(𝐹) is s𝛼rw closed in (𝑌, 𝜎). Therefore
f is s𝛼rw closed map.
Theorem: 2.29
If a mapping f: (𝑋, 𝜏) → (𝑌, 𝜎) is s𝛼rw closed, then s𝛼rw-𝑐𝑙(f(A)) ⊆ f(𝑐𝑙(A))
for every subset A of (𝑋, 𝜏)
Proof :
Suppose that f is s𝛼rw- closed and A ⊆ X. Then 𝑐𝑙(A) is closed in X and so
f (𝑐𝑙(A)) is s𝛼rw-closed in (𝑌, 𝜎). We have f (A) ⊆ f (𝑐𝑙 (A)),

𝑠𝛼rw-𝑐𝑙(f(A)) ⊆ s𝛼rw-𝑐𝑙(f(𝑐𝑙(A)) (1).
Since f (𝑐𝑙(A)) is s𝛼rw-closed in (Y, 𝜎), by remark 1.7(i),
s𝛼rw- 𝑐𝑙(f(𝑐𝑙(A))) = f(𝑐𝑙(A)) (2), from (1) and (2),
we have s𝛼rw- 𝑐𝑙(f(A)) ⊆ f(𝑐𝑙(A)) for every subset A of (𝑋, 𝜏).
Corollary: 2.30
If a mapping f: (𝑋, 𝜏) → (𝑌, 𝜎) is s𝛼rw- closed, then the image f(A) of closed
set A in (𝑋, 𝜏) is 𝜏sαrw-closed in(𝑌, 𝜎).
Proof:
Let A be a closed set in (𝑋, 𝜎). Since f is s𝛼rw-closed, by theorem 2.29,
s𝛼rw- 𝑐𝑙(f(A)) ⊆ f(𝑐𝑙(A)) (1). Also 𝑐𝑙(A) = A, as A is a closed set
and so f(𝑐𝑙(A)) = f(A) (2). From (1) and (2),
we have s𝛼rw-𝑐𝑙(f(A)) ⊆ f(A). We know that f(A) ⊆ s𝛼rw-𝑐𝑙(f(A)) and so
s𝛼rw-𝑐𝑙(f(A)) = (f(A)). Therefore f(A) is 𝜏sαrw-closed in (𝑌, 𝜎).
Theorem: 2.31
Let (𝑋, 𝜏) be any topological spaces and (𝑌, 𝜎) be a topological space where
ʺs𝛼rw 𝑐𝑙(A) = 𝛼-𝑐𝑙(A) for every subset A of Y ʺ and f: (𝑋, 𝜏) → (𝑌, 𝜎) be a
map, and then the following are equivalent.
i. f is sαrw-closed map.
ii. sαrw-𝑐𝑙(f(A)) ⊆ f(𝑐𝑙(A)) for every subset A of (𝑋, 𝜏).

Proof:
(i) ⇒ (ii) follows from the theorem: 2.29
(ii) ⇒ (i), Let A be any closed set of (𝑋, 𝜏).Then A = 𝑐𝑙(A) and so
f(A) = f(𝑐𝑙(A)) ⊇ s𝛼rw-𝑐𝑙(f(A)) by hypothesis. We have f(A) ⊆ s𝛼rw-𝑐𝑙(f(A)).
Therefore f(A) = s𝛼rw-𝑐𝑙(f(A)). Also f(A) = sαrw-𝑐𝑙(f(A)) = 𝛼-𝑐𝑙(f(A)),
by hypothesis. That is f(A) = 𝛼-𝑐𝑙(f(A)) and f(A) is 𝛼-closed in(Y, 𝜎).
Thus f(A) is s𝛼rw-closed set in (𝑌, 𝜎) and hence f is s𝛼rw-closed map.
Theorem: 2.32
A map f:(𝑋, 𝜏) → (𝑌, 𝜎) is s𝛼rw-closed if and only if for each subset S
of (𝑌, 𝜎) and each open set U containing f-1(𝑆) ⊆ U, there is a s𝛼rw-open set V
of (𝑌, 𝜎) such that S ⊆ V and f-1(𝑉 ) ⊆ U.
Proof:
Suppose f is s𝛼rw-closed. Let S ⊆ Y and U be an open set of (𝑋, 𝜏) such that
f-1(𝑆) ⊆ U. Now X- U is closed set in (𝑋, 𝜏). Since f is s𝛼rw-closed, f(𝑋 − 𝑈) is
s𝛼rw closed set in(𝑌, 𝜎). Then V = Y – f(𝑋 − 𝑈) is a s𝛼rw open set in (𝑌, 𝜎).
Note that f-1(𝑆) ⊆ U implies S⊆ V and f-1(𝑉 ) = X – f-1(f(X–U))
⊆ X – (𝑋 − 𝑈) = 𝑈 .That is f-1(V) ⊆ U.
For the converse, let F be a closed set of (𝑋, 𝜏). Then f-1(f(F))C) ⊆ FC and FC is
an open in(𝑋, 𝜏). By hypothesis, there exists s𝛼rw-open set V in (𝑌, 𝜎) such that
f(𝐹 )C ⊆ V and f-1(𝑉 ) ⊆ FC and so F ⊆ ((f-1(V))c. Hence VC ⊆ f(F)
⊆ f((f-1(V))C) ⊆ VC which implies f(F) = VC. Since VC is s𝛼rw-closed, f(F) is
s𝛼rw-closed. Thus f(F) is s𝛼rw-closed in (𝑌, 𝜎) and therefore f is s𝛼rw-closed
map.
Remark: 2.33
The composition of two s𝛼rw-closed maps need not be s𝛼rw-closed map in
general and this is shown by the following example.
Example: 2.34
Let X = Y = Z = {a, b, c}, 𝜏 = { X, ϕ, {a}, {b}, {a, b}, {a, c}},
𝜎 = { Y, ϕ, {a}, {b, c}} and 𝜂 = { Z, ϕ, {a}, {b}, {a, b}}. Define
f: (𝑋, 𝜏) → (𝑌, 𝜎) defined by f(a) = b, f(b) = c, f(c) = a and
g: (𝑌, 𝜎) → (𝑍, 𝜂) are the identify map. Then f and g are s𝛼rw-closed maps, but
their composition (g∘ 𝑓): (𝑋, 𝜏) → (𝑍, 𝜂) is not s𝛼rw-closed map, because
F = {a, c} is closed in (𝑋, 𝜏), but (g∘ 𝑓) = (g∘ 𝑓)({𝑎, 𝑐 }) = g[𝑓({𝑎, 𝑐 })] =
g[{𝑎, 𝑏}] = {a, b}, which is not s𝛼rw- closed in (Z, 𝜂).
Theorem: 2.35
If f: (𝑋, 𝜏) → (𝑌, 𝜎) is closed map and g: (𝑌, 𝜎) → (𝑍, 𝜂) is s𝛼rw-closed map,
then the composition (g∘ 𝑓): (𝑋, 𝜏) → (𝑍, 𝜂) is s𝛼rw-closed map.
Proof:
Let F be any closed set in (𝑋, 𝜏). Since f is closed map, f(F) is closed set in
(𝑌, 𝜎). Since g is s𝛼rw-closed map. g[𝑓(𝐹)] is s𝛼rw-closed set in (𝑍, 𝜂). That is
(g∘ 𝑓)(F) = g[f(F)] is s𝛼rw-closed and hence (g∘ 𝑓) is s𝛼rw-closed map.
Remark: 2.36
If f: (𝑋, 𝜏) → (𝑌, 𝜎) is s𝛼rw-closed map and g: (𝑌, 𝜎) → (𝑍, 𝜂) is closed map,
then the composition need not be s𝛼rw-closed map as seen from the following
example.
Example: 2.37
Let X = Y= Z = {a, b, c}, 𝜏 = {X, 𝜙, {a}, {b}, {a, b}}, 𝜎 = {Y, ϕ, {a}, {b, c}}
and 𝜂 = {Z, ϕ, {a}, {b},{a, b},{a, c}}. Define f: (𝑋, 𝜏) → (𝑌, 𝜎) define by
f(a) = b, f(c) = b, f(b) = c and g: (𝑌, 𝜎) → (𝑍, 𝜂) defined by g(a) = c, g(b) = a,
g(c) = c. Then f is s𝛼rw-closed map and g is closed map, but their composition
(g∘ 𝑓): (𝑋, 𝜏) → (𝑌, 𝜎) is not s𝛼rw-closed map, because F ={c} is closed in
(𝑋, 𝜏), but (g∘ 𝑓)(𝐹 ) =(g∘ 𝑓)({𝑐 }) =g[f({c})] = g[{b}] = {a}, which is not
s𝛼rw closed in (𝑍, 𝜂).
Theorem: 2.38
If f: (𝑋, 𝜏) → (𝑌, 𝜎) and g: (𝑌, 𝜎) → (𝑍, 𝜂) is s𝛼rw- closed maps and (𝑌, 𝜎) be
a 𝜏sαrw –space then (g∘ 𝑓): (𝑋, 𝜏) → (𝑍, 𝜂) is s𝛼rw-closed map.
Proof: Let A be a closed set of (𝑋, 𝜏). Since f is s𝛼rw-closed, f(A) is s𝛼rw-
closed in (𝑌, 𝜎). Then by hypothesis, f(A) is closed. Since g is s𝛼rw-closed,

g(f(A)) is s𝛼rw-closed in (𝑍, 𝜂) and g[f(A)] = (g∘ 𝑓)(A). Therefore (g∘ 𝑓) is
s𝛼rw-closed map.
Theorem: 2.39
If f: (𝑋, 𝜏) → (𝑌, 𝜎) is g-closed, g: ( 𝑌, 𝜎) → (𝑍, 𝜂) be s𝛼rw-closed and (𝑌, 𝜎) is
T1/2 space then their composition (g∘ 𝑓): (𝑋, 𝜏) → (𝑍, 𝜂) is s𝛼rw-closed map.
Proof:
Let A be a closed set of (𝑋, 𝜏). Since f is g-closed, f(A) is g-closed in (𝑌, 𝜎).
Since (𝑌, 𝜎) is T1\2–space, f(A) is closed in (𝑌, 𝜎). Since g is s𝛼rw-closed,
g[f(A)] is s𝛼rw-closed in (𝑍, 𝜂) and g(f(A)) = (g∘ 𝑓)(A). Therefore (g∘ 𝑓) is
s𝛼rw-closed map.
S𝜶rw*-closed maps
Now we define the new class of stronger from of s𝛼rw-closed maps is called
s𝛼𝑟𝑤*-closed maps in topological spaces.
Definition: 2.40
A map f: (𝑋, 𝜏) → (𝑌, 𝜎) is said to be s𝛼rw*-closed map if the image f(A) is
s𝛼rw-closed in (𝑌, 𝜎) for every s𝛼rw–closed A in (𝑋, 𝜏).
Theorem: 2.41
Every s𝛼rw*-closed map is s𝛼rw-closed map but not conversely.

Proof:
Let F be a closed set in X and the fact that every closed set in s𝛼rw-closed set.
Hence F is s𝛼rw-closed set in X. Since f: (𝑋, 𝜏) → (𝑌, 𝜎) be a s𝛼rw*-closed
map, f(F) is s𝛼rw-closed set in Y. Therefore f is s𝛼rw-closed map.
Example: 2.42
Let X = Y = {a, b, c}, 𝜏 ={Y, 𝜙, {a}, {b, c}} and 𝜎 = {Y,ϕ,{a},{b},{a, b}} and
f: (𝑋, 𝜏) → (𝑌, 𝜎) be the identity map. Then f is s𝛼rw-closed map but not
s𝛼rw*-closed map. Since {a, b} is s𝛼rw-closed set in (𝑋, 𝜏), but its image under
f is {a, b}, which is not s𝛼rw-closed in (𝑌, 𝜎).
Theorem: 2.43
If f: (𝑋, 𝜏) → (𝑌, 𝜎) and g: (𝑌, 𝜎) → (𝑍, 𝜂) are s𝛼rw* closed maps, then their
composition (g∘ 𝑓): (𝑋, 𝜏) → (𝑍, 𝜂) is also s𝛼rw*-closed.
Proof:
Let F be an s𝛼rw-closed set in (𝑋, 𝜏). Since f is s𝛼rw*-closed map, f(F) is
s𝛼rw-closed set in (𝑌, 𝜎). Since g is s𝛼rw* closed map, g(f(F)) is s𝛼rw closed
set in (𝑍, 𝜂). Therefore (g∘ 𝑓) is s𝛼rw*-closed map.
Conclusion:
In this paper we defined and studied s𝛼rw-closed map and s𝛼rw*-closed map.
References:-
1. AbdEl-Monsef ME, El-Deeb S N, Mahmoud RA. β- open sets and
β-continuous mappings, Bull. Fac. Sci. Assiut Univ1983; 12:77-90.
2. Arya S P, Gupta R. On strongly continuous functions, Kyungpook
Math.J.1974; 14:131-143.
3. Arya S P, T M Nour, Chatcterizations of s-normal spaces, Indian J Pure Appl,
Math. 1990; 21:717-719
4. Baker CW. Contra open and Contra closed functions, Math. Sci1994;
17:413-415.
5. Balachandran K, Sundaram P, Maki H. On Generalized Continuous Maps in
Topological Spaces, Mem. Iac Sci. Kochi Univ. Math., 1991; 12:5-13.
6. Basavaraj M Ittanagi and Mohan V, On semi α-regular weakly closed set in
Topological spaces, Int J. of Math Archive, 8(7)-2017, 197-204.
7. Basavaraj M. Ittanagi and Mohan V , On sαrw continuous and sαrw irresolute
Maps in Topological Spaces (Accepted paper in JUSPS)
8. Benchalli S.S, Wali R.S., on rω- Closed sets is Topological Spaces, Bull,
Malays, Math, sci, soc30, 2007, 99-110.
9. Benchalli S.S, Patil P.G, Rayanagaudar T.D. ωα-Closed sets is Topological
Spaces, The Global. J Appl. Math and Math. Sci. 2009; 2:53-63.
10. Bhattacharya S. on generalized regular closed sets, Int J Contemp.
Math science., 201(6), 145-152

11. Cameron DE. Properties of s-closed spaces, prac Amer Math, soc
1978;72:581-586
12. Dontchev J. Contra continuous functions and strongly S-closed spaces,
Int. J Math. Sci. 1996;
13. Gnanambal Y., on generalized pre regular closed sets in topological spaces,
Indian J Pure. Appl. Math.1997; 28(3):351-360.
14. Janaki C, Renu Thomas.on R*-Closed sets in Topological Spaces, Int J of
Math Archive. 2012; 3(8):3067-3074
15. Jastad ON. On some classes of nearly open sets, Pacific J Math.
1965; 15:961-970
16. Jayalakshmi A, JanakiC. on wgrα-closed sets in Topological Spaces,
Int J of maths. 2012; 3(6):2386- 2392.
17. Joshi V, Gupta S, Bhardwaj Kumar R. on Generalized pre Regular
weakly(gprw)-closed set in sets in Topological Spaces, int math foruro 2012;
7-40:1981- 1992
18. Levine N. Generalized closed sets in topology, Rend. Circ Mat. Palermo
1970; 19(2):89-96.
19. Long PE, Herington LL. Basic Properties of Regular Closed Functions,
Rend. Cir. Mat. Palermo1978; 27:20-28.
20. Maki H, Devi R, Balachandran K. Associated topologies of generalized
α-closed sets and α-generalized closed sets, Mem. Fac. Sci. Kochi Univ. Ser.
A. Math1994; 15:51-63.
21. Maki H, Umehara J, Noiri T. Every Topological space is pre T½mem Fac
sci, Kochi univ, Math 1996; 17:33-42.
22. Malghan S Generalized Closed Maps, J Karnataka Univ. Sci., 1982;
27:8288.
23. Mashhour AS, Abd El-Monsef ME, El-Deeb S N. On pre-continuous and
weak pre continuous mappings, Proc. Math. Phys. Soc. Egypt1982; 53:47-53.
24. Mishra S. On regular generalized weakly (rgw) closed sets in topological
spaces, Int. J of Math Analysis 2012; 6(30):1939-1952
25. Nagaveni N. Studies on Generalizations of Homeomorphisms in
Topological Spaces, Ph.D. Thesis, Bharathiar University, Coimbatore, 1999.
26. Navalagi G B. “On Semi-pre Continuous Functions and Properties of
Generalized Semi-pre Closed in Topology”, IJMS 2002; 29(2):85-98.
27. Pushpalatha A. Studies on generalizations of mapping in topological spaces,
PhD Thesis, Bharathiar university, Coimbatore,2000.
28. Shyala Isac Mary T, P Thangavelv.on Regular pre-semi closed sets in
topological spaces, KBM J of Math Sc & comp Applications. 2010;1:9-17
29. Stone M. Application of the theory of Boolean rings to general topology,
Trans. Amer. Math.Soc.1937;41:374- 481.
30. Sundaram P, Sheik John M. On w-closed sets in topology, Acta Ciencia
Indica2000; 4:389-39
31. Thivagar M L. A note on quotient mapping, Bull. Malaysian Math. Soc
1991; 14:21-30
32. Vadivel A, K vairamamanickam. rgα-Closed sets & rgα- open sets in
Topological Spaces, Int J of math, Analysis. 2009; 3(37):1803-1819
33. Veerakumar MKRS. On α-generalized regular closed sets, Indian J of Math.
2002; 44(2):165-181
34. Wali R.S., Mandalgeri P.S. On αrw–Continuous and αrw–Irresolute Maps in
Topological Spaces, IOSR-JM 2014; 10(6):14-24.

A STUDY ON gg-OPEN SETS IN TOPOLOGICAL SPACE
R. SHEEBA1 and Dr. R.S. SURIYA2
1
II M.sc Mathematics, Sree Ayyappa College for Women, Chunkankadai
2
Abstract
In this research paper, a new class of open sets called gg-open sets in topological
space are introduced and studied. Also some of their properties have been
investigated. We also introduced gg-closure, gg-interior, gg-neighbourhood,
gg-limit points and discuss some properties.
2010 Mathematics Classification: 54A05, 54A10
Key words:
gg-closed sets, gg-open sets, gg-closure, gg-interior, gg-neighbourhood, gg-limit
points.
Introduction:
The regular semi open sets are introduced and investigated by Cameron2. Levin7
and Savithri11 introduced and studied generalized closed sets and r^g closed sets
respectively. Basavaraj M ittanagi and Govardhana Reddy1 introduced and

studied gg-closed sets. We introduced and studied gg-open sets, gg-interior, gg-
neighbourhood, gg-closure and gg-limit points in topological space. Throughout
this paper X or (X, 𝜏) represents a topological space. For a subset A of a
topological space (X, 𝜏), cl(A), int(A), scl(A), 𝛼cl(A), spcl(A) and gcl(A) denote
the closure of A, the interior of A, the semi-closure of A, the 𝛼-closure of A, the
semi pre closure of A and the g-closure of A in X respectively.
Preliminaries:
Definition 1.1:
A subset A of a topological space (X, 𝜏) is called a
1. Regular open set14 if A = int(cl(A)) and regular closed if
A = cl(int(A)).
2. Regular semi open set if there exists a regular open set U such that U ⊆ A
⊆ cl(U).
3. 𝜃-closed set18 if A = 𝑐𝑙𝜃(A), where 𝑐𝑙𝜃(A) = {x ∈ X: cl(U) ∩ A ≠ A, U ∈
τ &x ∈ U}. 𝛿-closed set18 if A = 𝑐𝑙𝛿(A), where
𝑐𝑙𝛿(A) = {x ∈ X: int(U) ∩ A ≠ A, U ∈ τ &x ∈ U}.
4. Generalized closed set (g-closed)7 if cl(A) ⊆ U whenever A ⊆ U and U is
open in (X, 𝜏).
5. 𝜃-generalized closed set (𝜃g-closed)4 if cl𝜃(A) ⊆ U whenever
A ⊆ U and U is open in (X, 𝜏).

6. 𝛿-generalized closed set (𝛿g-closed)5 if cl 𝛿(A) ⊆ U whenever
A ⊆ U and U is open in (X, 𝜏).
7. 𝜔-closed set13 if cl(A) ⊆ U whenever A ⊆ U and U is semi-open in (X, 𝜏)
Strongly generalized closed set (g∗-closed) [16] if cl(A) ⊆ U whenever A
⊆ U and U is g-open in (X, 𝜏).
8. ∗g𝛼-closed set19 if cl(A) ⊆ U whenever A ⊆ U and U is g𝛼-open in (X, 𝜏).
9. ∗∗g𝛼-closed set20 if cl(A) ⊆ U whenever A ⊆ U and U is ∗g𝛼-open in
(X, 𝜏).
10. rb-closed set9 if cl(A) ⊆ U whenever A ⊆ U and U is b-open
11. g#-closed set17 if cl(A) ⊆ U whenever A ⊆ U and U is 𝛼g-open in (X, 𝜏).
12. rb-closed set9 if cl(A) ⊆ U whenever A ⊆ U and U is b-open
13. g#-closed set17 if cl(A) ⊆ U whenever A ⊆ U and U is 𝛼g-open in (X, 𝜏).
14. gr-closed set12 if rcl(A) ⊆ U whenever A ⊆ U and U is open in (X, 𝜏).
15. swg∗-closed set8 if gcl(A) ⊆ U whenever A ⊆ U and U is semi- open in
(X, 𝜏).
16. 𝛽wg∗-closed set3 if gcl(A) ⊆ U whenever A ⊆ U and U is 𝛽-open in
(X, 𝜏).
17. rwg-closed set10 if cl(int(A)) ⊆ U whenever A ⊆ U and U is regular-open
in (X, 𝜏).
18. 𝛽wg∗∗-closed set15 if 𝛽wg∗ cl(A) ⊆ U whenever A ⊆ U and U is
regular-open in (X, 𝜏).

19. r^g-closed set11 if gcl(A) ⊆ U whenever A ⊆ U and U is regular-open in
(X, 𝜏).
The complement of the closed sets mentioned above are their open sets
respectively and vice versa.
Lemma 1.1:
i) Every regular closed set is 𝜃-closed.
ii) Every regular closed set is 𝛿- closed.
iii) Every regular closed set is 𝜋- closed.
iv) Every regular closed set is 𝜃g-closed.
v) Every regular closed set is 𝛿g- closed.
vi) Every regular closed set is g∗- closed.
vii) Every regular closed set is 𝜔- closed.
viii) Every regular closed set is g#- closed.
ix) Every regular closed set is 𝛽wg∗- closed.
x) Every regular closed set is ∗g𝛼- closed.
xi) Every regular closed set is ∗∗g𝛼- closed.
xii) Every regular closed set is rb- closed.
xiii) Every regular closed set is swg∗- closed.
xiv) Every regular closed set is gr- closed.

Lemma 1.2:
i) Every gg-closed set is r^g-closed.
ii) Every gg-closed set is rwg-closed.
iii) Every gg-closed set is 𝛽wg∗∗- closed.
Definition 1.3: gg-CLOSED SET IN TOPOLOGICAL SPACE:
A subset A of a topological space (X, 𝜏) is called generalization of generalized
closed (gg-closed) set if gcl(A) ⊆ U whenever
A ⊆ U and U is regular semi- open in (X, 𝜏).
Result 1.4:
i) Every closed (respectively regular-closed, 𝜃-closed, 𝛿- closed,
𝜋- closed, 𝜃g-closed, 𝛿g- closed, g∗- closed, 𝜔- closed, g#- closed,
𝛽wg∗- closed,∗g𝛼- closed, ∗∗g𝛼- closed, rb- closed, swg∗- closed,
gr- closed) set is gg-closed set in X.
ii) Every gg-open set is r^g-closed (respectively rwg-closed,
𝛽wg∗∗- closed) set in X.
iii) The union of two gg-closed sets is gg-closed set in X.

2. gg-OPEN SET IN TOPOLOGICAL SPACE:
Definition: 2.1
A subset A of a topological spaces (X, 𝜏) is called a gg-open set in X if AC is a
gg-closed set in X.
The following Theorem is the analogue of result.
Theorem: 2.2
For any topological spaces (X, 𝜏) we have the following
i) Every open (respectively regular-open, 𝜃-open, 𝛿-open, 𝜋-open,
𝜃g-open, 𝛿g-open, g∗-open, 𝜔-open, g#-open, 𝛽wg∗-open,∗g𝛼-open,
∗∗g𝛼-open, rb-open, swg∗-open, gr-open) set is gg-open set in X.
ii) Every gg-open set is r^g-open (respectively rwg-open, 𝛽wg∗∗-open) set
in X.
Proof:
i) Let A be open set in X. Then AC closed set in X. Since every closed set
is gg-closed in X. AC is gg-closed in X. This implies A is gg-open set in
X.
ii) Let A be a regular open set in X. Then AC is regular closed in X. Since,
every regular closed set is gg-closed (By Lemma 1.1(i)), AC is gg-closed
in X. This implies A is a gg-open set in X.

iii) Let A be a 𝜃-open set in X. Then AC is 𝜃-closed in X. Since, every
𝜃-closed set is gg-closed (By Lemma 1.1(ii)), AC is gg-closed in X. This
implies A is a gg-open set in X.
iv) Let A be a 𝛿-open set in X. Then AC is 𝛿-closed in X. Since, every
𝛿-closed set is gg-closed (By Lemma 1.1(iii)), AC is closed in X. This
implies A is a gg-open set in X.
v) Let A be a 𝜋-open set in X. Then AC is 𝜋-closed in X. Since, every
regular closed set is gg-closed (By Lemma 1.1(iv)), AC is gg-closed in
X. This implies A is a gg-open set in X.
vi) Let A be a 𝜃g-open set in X. Then AC is 𝜃g-closed in X. Since, every
𝜃g-closed set is gg-closed (By Lemma 1.1(v)), AC is gg-closed in X.
This implies A is a gg-open set in X.
vii) Let A be a 𝛿g-open in X. Then AC is 𝛿g-closed in X. Since, every
𝛿g-closed set is gg-closed (By Lemma 1.1(vi)), AC is gg-closed in X.
This implies A is a gg-open in X.
viii) Let A be a g∗-open in X. Then AC is g∗-closed in X. Since, every
g∗-closed set is gg-closed (By Lemma 1.1(vii)), AC is gg-closed in X.
ix) Let A be a 𝜔-open in X. Then AC is 𝜔-closed in X. Since, every
𝜔-closed set is gg-closed (By Lemma 1.1(viii)), AC is gg-closed in X.

x) Let A be a g#-open in X. Then AC is g#-closed in X. Since, every
g#- closed set is gg-closed (By Lemma 1.1(ix)), AC is gg-closed in X.
xi) Let A be a 𝛽wg∗-open in X. Then AC is 𝛽wg∗-closed in X. Since, every
𝛽wg∗-closed set is gg-closed (By Lemma 1.1(x)), AC is gg-closed in X.
xii) Let A be a ∗g𝛼-open in X. Then AC is ∗g𝛼-closed in X. Since, every
∗g𝛼-closed set is gg-closed (By Lemma 1.1(xi)), AC is gg-closed in X.
xiii) Let A be a ∗∗g𝛼- open in X. Then AC is ∗∗g𝛼-closed in X. Since, every
∗∗g𝛼-closed set is gg-closed (By Lemma 1.1(xii)), AC is gg-closed in
X. This implies A is a gg-open in X.
xiv) Let A be a rb-open in X. Then AC is rb-closed in X. Since, every
rb-closed set is gg-closed (By Lemma 1.1(xiii)), AC is gg-closed in X.
xv) Let A be a swg∗-open in X. Then AC is swg∗-closed in X. Since, every
swg∗-closed set is gg-closed (By Lemma 1.1(xiv)), AC is gg-closed in
X. This implies A is a gg-open in X.
xvi) Let A be a gr-open in X. Then AC is gr-closed in X. Since, every
gr-closed set is gg-closed (By Lemma 1.1(xv)), AC is gg-closed in X.

xvii) Let A be a gg-open in X. Then AC is a gg-closed in X. Since, every
gg- closed set is r^g-closed (By Lemma 1.2(i)), AC is r^g -closed in X.
This implies A is a r^g -open in X.
xviii) Let A be a gg-open in X. Then AC is a gg-closed in X. Since, every
gg- closed set is rwg-closed (By Lemma 1.2(ii)), AC is rwg-closed in X.
This implies A is a rwg -open in X.
xix) Let A be a gg-open in X. Then AC is a gg-closed in X. Since, every
gg- closed set is 𝛽wg∗∗-closed (By Lemma 1.2(iii)), AC is
𝛽wg∗∗-closed in X. This implies A is a 𝛽wg∗∗-open in X.
Theorem: 2.3
If A and B are gg-open sets in X then (A∩B) is also a gg-open set in X.
Proof:
Let A and B be gg-open sets in X. Then Ac and Bc are gg-closed sets in X. By
Result 1.4 (Ac∪Bc) is also gg-closed set in X. That is (Ac∪Bc) = (A∩B)c is
gg-closed set in X. Therefore (A∩B) is gg-open set in X.
Remark: 2.4
The union of gg-open sets in X is generally not a gg-open sets in X.

Example:2.5
Let X = {p, q, r}, 𝜏 = {∅, X, {p}, {q}, {p, q }, {p, q, r}}. If A = {q} and B = {r} then
A and B are gg-open sets but (A∪B) = {q, r} is not a gg-open sets in X.
Theorem: 2.6
A subset A of topological space X is gg-open iff U ⊆ gint(A) whenever U ⊆ A
and U is regular semi open in X.
Proof:
Suppose A is gg-open, U ⊆ A and U is regular semiopen. Then Ac ⊆ Uc and Uc is
also regular semi open. By the definition of gg-closed gcl(Ac) ⊆ Uc. But
gcl(Ac) = (gint (A))c = X − gint(A). This implies that U ⊆ gint(A).
Conversely: Suppose that U ⊆ gint(A) whenever U ⊆ A and U is regular semi
open in X. Let Ac ⊆ F where F is regular semiopen in X. Fc ⊆ A and Fc is regular
semi open in X. We know that Fc ⊆ gint (A) and (gint(A))c ⊆ F. Since,
gcl (Ac) = (gint(A))c we have gcl (Ac) ⊆ U. Thus Ac is gg-closed set. That is A is
gg-open set.
Theorem: 2.7
If gint(A) ⊆ B ⊆ A and A is gg-open set then B is gg-open set.

Proof:
Let gint(A) ⊆ B ⊆ A and A is gg-open set in X. Let F be regular semi open set
in X such that F ⊆ B ⊆ A. Now by theorem 2.6, F ⊆ gint(A). We have
gint(A) ⊆ B then A ⊆ gint(B). That is gint(A) ⊆ gint (B). This implies that
F ⊆ int(B). Now by theorem 2.6, B is gg-open set.
Theorem: 2.8
If A ⊆ X is gg-closed set. Let F ⊆ gcl(A)−A is gg-open set.
Proof:
Let A be gg-closed set. Let F ⊆ gcl(A)−A, where F is regular semi open in X and
hence F = ∅. Then F ⊆ gint(gcl(A)−A) and by Theorem 2.6, gcl(A)−A is
gg-open set.
Remark: 2.9
If gcl(A)−A is gg-open set then A is need not be a gg-closed set in X.
Example: 2.10
Let X = {p, q, r, s}, 𝜏 = {∅, X, { p}, {q}, {p, q }, {p, q, r}}. A = {q, r },
gcl(A)−A = {q, r, s} − {q, r} = {s} is gg-open set in X but A is not gg-closed set.
gg-CLOSURE AND gg-INTERIOR IN TOPOLOGICAL SPACE
Definition: 2.12
For a subset A of (X, 𝜏), gg-closure of A is denoted by ggcl(A) and it is defined
as ggcl(A) = ∩ {G: A ⊆ G, G ⊆ GGC(X)} or intersection of all gg-closed sets
containing A.
Theorem: 2.13
If A and B are subsets of space (X, 𝜏) then
i) ggcl(X) = X, ggcl(∅) = ∅
ii) A ⊆ ggcl(A)
iii) If B is any gg-closed set containing A then ggcl(A) ⊆ B
iv) If A ⊆ B then ggcl(A) ⊆ ggcl(B)
v) ggcl(A) = ggcl(ggcl(A))
vi) ggcl(A∪B) = (ggcl(A)∪ggcl(B))
Proof:
i) By the definition of gg-closure, ggcl(X) = intersection of all gg-closed set
in X = X∩gg-closed set containing X = X∩X = X. Therefore ggcl(X) = X.
By the definition of gg-closure, ggcl (∅) = intersection of all gg-closed set
containing ∅ = ∅ ∩any gg-closed set containing ∅ = ∅ ∩ ∅ = ∅. Therefore
ggcl (∅) = ∅.
ii) By the definition of gg-closure of A, it is obvious that A ⊆ ggcl(A).
iii) Let B be any gg-closed set containing A. Since ggcl(A) is the intersection
of all gg-closed set containing A. ggcl(A) is contained in every gg-closed
set containing A. Hence in particular ggcl(A) ⊆ B.
iv) Let A and B be subsets of (X, 𝜏) such that A ⊆ B. By the definition of
gg-closure, ggcl(B) = ∩ {F: B ⊆ F ∈ ggcl(X)}. If B ⊆ F∈ggcl(X) then
ggcl(B) ⊆ F. Since A ⊆ B ⊆ F∈ggcl(X), we have ggcl(A) ⊆ F,
ggcl(A) ⊆ ∩ {F: B ⊆ F ∈ ggcl(X)} = ggcl(B). Therefore
ggcl(A) ⊆ ggcl(B).
v) Let A be any subset of X. By the definition of gg-closure,
ggcl(A) = ∩ {F: B ⊆ F ∈ ggcl(X)}. If A ⊆ F ∈GGC(X), then ggcl(A) ⊆ F.
Since F is a gg-closed set containing ggcl(A), by (iii) ggcl(ggcl(A)) ⊆ F.
Hence ggcl(ggcl(A)) ⊆ ∩ {F: A ⊆ F ∈ ggcl(X)} = ggC(A). That is
ggcl(ggcl(A)) = ggcl(A).
vi) Let A and B be subsets of (X, 𝜏). Clearly A ⊆ (A∪B) and B ⊆ (A∪B).
From iv) (ggcl(A)∪ggcl(B)) ⊆ ggcl(A∪B)⟶(1). Now we have to prove
that ggcl(A∪B) ⊆ ggcl(A)∪ggcl(B). Suppose x ∉ (ggcl(A)∪ggcl(B))
then their exists gg-closed sets A1 and B1 such that A ⊆ A1, B ⊆ B1 and
x ∉ (A1∪B1). Thus we have (A∪B) ⊆ (A1∪B1) and (A1∪B1) is a
gg-closed set By Result 1.4 x ∉ (A1∪B1). Thus x ∉ ggcl(A∪B). Hence
ggcl(A∪B) ⊆ (ggcl(A)∪ggcl(B)) ⟶(2).

From (1) and (2) we have ggcl(A∪B) = (ggcl(A)∪ggcl(B)).
Theorem: 2.14
If A ⊆ X is gg-closed set then ggcl(A) = A.
Proof:
Let A be any gg-closed set in X. We have A ⊆ ggcl(A)⟶(1). By Theorem 2.13,
ggcl (A) ⊆ A⟶(2). From (1) and (2), ggcl(A) = A.
Remark: 2.15
If ggcl(A) = A then A is need not be a gg-closed set in X.
Example: 2.16
Let X = {p, q, r} and 𝜏 = {∅, X ,{ p}, {q}, {p, q}, {p, r}} be a topology on X. Then
GGC(X) = {∅, X, {q}, {r}, {p, q}, {p, r}, {q, r}} . Now ggcl({𝑝}) = {p}. But {p} is
not a gg-closed set in X.
Theorem: 2.17
If A and B are the subsets of topological space (X, 𝜏) then
ggcl(A∩ 𝐵) ⊆ ggcl(A)∩ggcl(B).
Proof:
Let A ⊆ X and B ⊆ X. We know that (A∩B) ⊆ A and (A∩B) ⊆ B. Then by
Theorem 2.13 we have ggcl(A∩B) ⊆ ggcl(A) and ggcl(A∩B) ⊆ ggcl(B).
Therefore ggcl(A∩ B) ⊆ ggcl(A)∩ggcl(B).

Remark: 2.18
In general ggcl(A)∩ggcl(B) is need not be a subset of ggcl(A∩B).
Example: 2.19
Let X = {p, q, r} and 𝜏 = {∅, X, {p}, {q}, {p,q}, {p, r}} be a topology on X. Let
A = {p} and B = {r} are subsets of X. Now A∩B = ∅, ggcl(A) = {p},
ggcl(B) = {p, r} and ggcl(A∩ B) = ∅ but (ggcl(A)∩ggcl(B)) is not a subset of
ggcl(A∩B).
Theorem: 2.20
i) ggcl(A) ⊆ cl(A)
ii) ggcl(A) ⊆ gcl(A)
iii) r^g-cl(A) ⊆ ggcl(A)
Proof:
i) Let A ⊆ X. We have cl(A) = ∩ {F: A ⊆ F ∈ C(X)}. Since every closed
set is gg-closed, if A ⊆ F ∈ C(X) then A ⊆ F ∈ 𝐺𝐺𝐶(𝑋). This is
ggcl(A) ⊆ F. Therefore ggcl(A) = ∩ {𝐹: 𝐴 ⊆ 𝐹 ∈ 𝐶(𝑋)} = cl(A).
Hence ggcl(A) ⊆ cl(A).
ii) The proof is straight forward.
iii) The proof is straight forward.

Theorem: 2.21
Let A be any subset of topological space X. Then x ∈ ggcl(A) if and only if
U∩A ≠ ∅ for every gg-open set U containing X.
Proof:
We prove this theorem by contradiction. Let x ∈ ggcl(A) and suppose there
is a gg-open set U in X such that x ∈ U and U∩A = ∅ . Therefore A ⊆ UC which
is gg-closed set in X. Also ggcl (A) ⊆ ggcl (Uc) = Uc. Then x ∉ U⟹x ∉ ggcl(A).
This is a contradiction.
Conversely, suppose that U∩A ≠ ∅ for any gg-open set V containing x. To
prove x ∈ ggcl(A). suppose x ∉ ggcl(A), then there exists a gg-closed set F in
X such that x ∉ F and A ⊆ F. That is x ∈ FC which is gg-open set in X. Since
A ⊆ F, A∩F = ∅. This is a contradiction. Therefore x ∈ ggcl(A).
Definition: 2.22
For a subset A of (X, 𝜏), gg-interior of A is denoted by ggint(A) and it is
defined as ggint(A) =∪ {G: G ⊆ A and G is gg − open in X} or
∪ {G: G ⊆ A and G ∈ GGO(X)} or ggint(A) is the union of all gg-open sets
contained in A.
Theorem: 2.23
Let A and B be subsets of space X then

i) ggint(X) = X, ggint(∅) = ∅
ii) ggint(A) ⊆ A
iii) If B is any gg-open set containing in A then B ⊆ ggint(A)
iv) If A ⊆ B then ggint(A) ⊆ ggint(B)
v) ggint(A) = ggint(ggint(A))
vi) ggint(A∩B) = (ggint(A)∩ggint(B)).
Proof:
i) Since X is gg-open sets, by Definition 2.22, gg-int(X) = ∪ {𝐺: G is
gg-open and G ⊆ X = X ∪ all gg-open sets} = X. Since ∅ is the only
gg-open set contained in ∅, gg-int(∅) = ∅.
ii) Let x ∈ gg-int(A). Then x is a gg-interior point of A. Therefore A is a
gg-neighbourhood of x. This implies x∈A. Therefore gg-int(A) ⊆ A.
iii) Let B be any gg-open set such that B ⊆ A. Let x ∈ B, B be gg-open set
contained in A, x is an interior point of A that is x ∈ gg-int(A). Hence
B ⊆ ggint (A).
iv) Let A ⊆ X and B ⊆ X be such that A ⊆ B. Let x ∈ gg-int(A). Then x is
a gg-interior points of A. This implies A is a gg-neighbourhood of x.
Since A ⊆ B, B is a gg-neighbourhood of x. This implies x ∈ gg-int(B).
Therefore gg-int(A) ⊆ gg-int(B).
v) From (ii) and (iv), gg-int(gg-int(A)) ⊆ gg-int(A). Let x ∈ gg-int(A).
Then A is a gg-neighbourhood of x. This implies that there exists a

gg-open set G such that x ∈ G ⊆ A. Therefore every point of G is a
gg-interior point of A. Hence x ∈ G ⊆ gg-int(A). Thus x is a gg-interior
point of gg-int(A). Therefore x ∈ gg-int(gg-int(A)).
vi) Let A ⊆ X and B ⊆ X. clearly A∩B ⊆ A and A∩B ⊆ B. by iv),
gg-int(A∩B) ⊆ gg-int(A) and gg-int(A∩B) ⊆ gg-int(B). Therefore
gg-int(A∩B) ⊆ gg-int(A)∩gg-int(B). Let x ∈ gg-int(A)∩gg-int(B).
Then x ∈ gg-int(A) and x ∈ gg-int(B). This implies A is a
gg-neighbourhood of x and B is a gg-neighbourhood of x. Therefore
A∩B is a gg-neighbourhood of x. Hence x ∈ gg-int(A∩B). Therefore
ggint(A∩B) = (ggint(A)∩ggint(B)).
Theorem: 2.24
If a subset A of X is gg-open the gg-int(A) = A.
Proof:
Let A be gg-open set of X. We know that gg-int(A) ⊆ A ⟶(1). Also A is gg-open
set contained in A from Theorem 2.23 iii), A ⊆ gg-int(A)⟶(2). Hence from (1)
and (2) gg-int(A) = A.
Theorem: 2.25
If A and B are subsets of space X then (gg-int(A)∪gg-int(B)) ⊆ gg-int(A∪B).

Proof:
We know that A ⊆ (A∪B) and B ⊆ (A∪B). We have Theorem 2.22 iv),
gg-int(A) ⊆ gg-int(A∪B) and gg-int(B) ⊆ gg-int(A∪B). This implies that
gg-int(A)∪gg-int(B) ⊆ gg-int(A∪B).
Remark: 2.26
In general gg-int(A∪B) is not a subset of (gg-int(A)∪gg-int(B)).
Example:2.27
Let X = {p, q, r} and 𝜏 = {∅, X, {p}, {q}, {p, q}, {p, r}} be a topology on X. Let
A = {q, r} and B = {p, q} are subsets of X. Now A∪B = X, gg-int(A) = {q, r},
gg-int(B) = {𝑞} , gg-int(A∪B) = X and (gg-int(A)∪ gg-int(B)) = {𝑞, 𝑟 } but
gg-int(A∪B) is not a subset of (gg-int(A)∪ gg-int(B)).
Theorem: 2.28
If A ⊆ X then
i) int(A) ⊆ gg-int(A)
ii) g-int(A) ⊆ gg-int(A)
iii) gg-int(A) ⊆ r^g-int(A)
Proof:
i) Let A ⊆ X. Let x ∈ int(A) ⟹ x ∈ ∪ {G: G is gg − open, G ⊆ A}. Then
exists an open set G such that x ∈ G ⊆ A. Since every open set is
gg-open, we have gg-open set G such that x ∈ G ⊆ A. This implies that

x ∈ ∪ {G: G is gg − open, G ⊆ A} ⟹ x ∈ gg-int(A). Hence
int (A) ⊆ gg-int(A).
ii) The proof is straight forward.
iii) The proof is straight forward.
gg-NEIGHBOURHOOD AND gg-LIMIT POINTS IN TOPOLOGICAL
SPACE
Definition: 2.29
Let (X, 𝜏) be a topological space and x ∈ X. A subset N of X is said to be
gg-neighbourhood of x if their exists gg-open set G such that x ∈ G ⊆ N.
Definition: 2.30
Let (X, 𝜏) be a topological space and A be a subset of X, a subset N of X is said
to be gg-neibourhood of A if their exists gg-open set G such that A ⊆ G ⊆ N.
Definition: 2.31
The collection of all gg-neighbourhood of x∈X is called gg-neighbourhood
system at x and it is denoted by gg-N(X).
Theorem: 2.32
Every neighbourhood N of x belongs to X is a gg-neighbourhood of X.

Proof:
Let N be a neighbourhood of x ∈ X. To prove that N is a gg-neighbourhood of x,
by the definition of neighbourhood there exists an open set G such that
x ∈ G ⊆ N. Hence N is a gg-neighbourhood of x.
Remark: 2.33
In general, a gg-neighbourhood N of x belongs to X need not be a neighbourhood
of x in X as seen from the following example.
Example: 2.34
Let X = {p, q, r, s } and 𝜏 = {∅, x, {p}, {q}, {p, q}, {p, q, r}}. Then
GGO(X) = {∅, X, {p}, {q}, {r}, {s }, {p, q} , {q, r} , {r, s} , {p, q, r}}. Then set {q, r, s}
is a gg-neighbourhood of the point s. Since the gg-open set {r, s} is such that
s ⊆ {r, s} ⊆ {q, r, s} . However the set {q, r, s} is not a neighbourhood of the
point d, since no open set G exists such that r ∈ G ⊆ {r, s}.
Theorem: 2.35
If a subset N of a space X is gg-open then N is a gg-neighbourhood of each of
its points.
Proof:
Suppose N is gg-open. Let x ∈ N. We claim that N is gg-neighbourhood of X.
For N is a gg-open set such that x ∈ N ∈ N. Since x is arbitrary point of N, it
follows that N is a gg-neighbourhood of each of its points.

Remark: 2.36
The converse of the above theorem is not true in general as seen from the
following example.
Example: 2.37
Let X = {p, q, r} with topology 𝜏 = {∅, X, {p}, {q}, {p, q}}. Then
ggO(X) = {∅, X, {p}, {q}, {𝑟}, {p, q}}. The set {p, r} is a gg-neighbourhood of
each of its points but not a gg-open set in X.
Theorem: 2.38
Let X be a topological space. If F is a gg-closed subset of X and x ∈ FC then
prove that there exists a gg-neighbourhood N of x such that N∩F = ∅.
Proof:
Let F be gg-closed subset of X and x ∈ FC. The FC contains a gg-neighbourhood
of each of its points. Hence there exists a
gg-neighbourhood of x such that N ⊆ FC. That is N∩F = ∅.
Theorem: 2.39
Let X be a topological space and for each x ∈ X. Let gg-N(x) be the collection of
all gg-neighbourhoods of x. Then we have the following results.
i) For all x ∈ X, gg-N(x)≠ ∅
ii) N ∈ gg-N(x) ⟹x ∈ N
iii) N ∈ gg-N(x), M contains N ⟹M ∈ gg-N(x)
iv) N ∈ gg-N(x), M ∈ gg-N(x) ⟹(N∩M) ∈ gg-N(x)
v) N ∈ gg-N(x) ⟹There exists M ∈ gg-N(x) such that M ⊆ N and
M ∈ gg-N(y) for every y ∈ M.
Proof:
i) Since X is a gg-open set, it is a gg-neighbourhood of every x ∈ X. Hence
there exists at least one gg-neighbourhoood (namely X) for each x ∈ X.
Let gg-N(x) be the collection of all gg-neighbourhoods of x. Hence
gg-N(x) ≠ ∅.
ii) If N ∈ gg-N(x) then N is a gg-neighbourhood of x. So by the definition
of gg-neighbourhood, x ∈ N.
iii) Let N ∈ gg-N(x), M contains N. Then there is
gg-open set G such that x ∈ G ⊆ N. Since N ⊆ M, x ∈ G ⊆ M and so M
is a gg-neighbourhood of x. Hence M ∈ gg-N(x).
iv) Let N ∈ gg-N(x) and M ∈ gg-N(x). Then by the definition of
gg-neighbourhood there exist gg-open sets G1 and G2 such that
x ∈ G1 ⊆ N and x ∈ G2 ⊆ N. Hence x ∈ (G1∩G2) ⊆ (N∩M). This
implies that N∩M is a gg-neighbourhood of x. Hence (N∩M) ∈ gg-
N(x).
v) If N ∈ gg-N(x) then there exists a gg-open set M such that x ∈ M ⊆ N.
Since M is a gg-open set it is a gg-neighbourhood of each of its points.
Therefore M ∈ gg-N(y), for y ∈ M.
Definition: 2.40
Let (X, 𝜏) be a topological space and A be a subset of X, then a point x ∈ X is
called a gg-limit point of A iff every gg-neighbourhood of x contains a point of A
distinct from x that is (N- {x} ∩A) ≠ ∅ for each each gg-neighbourhood N of x.
Also equivalently, every gg-open set G containing x contains a point of A which
is other than x.
Definition: 2.41
The set of all gg-limit point of the set A is called a derived set A and is denoted
by ggd(A).
Theorem: 2.41
Let (X, 𝜏) be a topological space. Let A and B are any two subsets of X. If A ⊂ B
then ggd(A) ⊂ ggd(B).
Proof:
Let A and B be any two subsets of x such that A ⊂ B. Let x ∈ ggd(A) that is x is
gg-limit point of A. Let G be any gg-open set containing x. Since x is gg-limit
point of A, by the definition, G∩(A−{x}) ≠ ∅ →(1). Since A ⊂ B we have
A−{x} ⊂ B−{x} and G∩(A−{x}) ⊂ G∩(B−{x}) ⟹ G∩(A−{x}) ≠ ∅. Therefore

G∩(A−{x}) ≠ ∅ for every gg-open set containing x. That is x is a gg-limit point
of B and x ∈ d(B). Then x ∈ ggd(A) ) ⟹x ∈ggd(B).
∴ ggd(A) ⊂ ggd(B).
Theorem: 2.43
Let (X, 𝜏) be a topological space and A be any subset of X then A is gg-closed set
iff ggd(A) ⊂ A.
Proof:
Suppose A is gg-closed. To prove that ggd(A) ⊂ A. Let x ∉ A⟹x ∈ X−A and
X−A is gg-open set containing x and (X−A)∩A= ∅ that is
(X−A)∩(A−{x}) = ∅. Therefore there exists gg-open set (X−A) containing x
such that (X−A)∩( A−{x}) = ∅. Therefore x is not a gg-limit point of A and
x ∉ ggd(A) that is ggd(A) ⊂ A.
Conversely: Suppose ggd(A) ⊂ A. To prove A is gg-closed set that is to prove
X−A is a gg-open. Let x ∈ (X−A)⟹x ∉ A and x ∉ ggd(A). Then there exists an
gg-open set G containing x such that G∩(A−{x}) = ∅ ⟹G∩A = ∅
⟹G ⊂ (X−A). Therefore ∀x ∈ (X−A) there exist a gg-open set G such that
x ∈ G ⊂ X−A.
∴ X−A is gg-open set and hence A is gg-closed set.

REFERENCES
1. Basavaraj M Ittanagi and Govardhana Reddy H G, On gg-Closed Sets in
Topological Spaces, International Journal of Mathematical Archive-8(8), 126-
133 (2017).
2. D. E. Cameron, Properties of s-closed spaces Proc. Amer. Math. Soc., 72, 581-
586 (1978).
3. C. Dhanapakyam J. Subashini and K. Indirani, ON - βwg* set and continuity
in topological spaces, IJMA-5(5), 222-233 (2014).
4. J. Dontchev and H.Maki, On -generalized closed sets, International J. Math
and Math. Sci. Vol 22, No 2, 239-249.
5. J.Dontchev and M.Ganster, On -generalized set 4 T3 spaces, Mem. Fac. Sci.
Kochi Uni. Ser. A. Math., 17, 15-31 (1996).
6. J. Dontchev and T. Nori, Quasi-normal spaces and g-closed sets, Acta Math.
Hungar 89(3), 211-219 (2000).
7. N. Levine, Generalized closed sets in topology, Rend. Circ. Mat. Palermo,
19(2), 89-96 (1970).
8. C. Mukundhan and N. Nagaveni, A Weaker Form of a Generalized Closed Set,
Int. J. Contemp. Math. Sciences, Vol. 6, no. 20, 949 – 961 (2011).
9. A. Narmadha, N. Nagaveni and T. Noiri, On Regular b-Open Sets in
Topological Spaces Int. Journal of Math. Analysis, Vol. 7, no. 19, 937 – 948
(2013).
10. Sanjay Mishra, Nitin Bhardwaj and Varun Joshi, On Regular Generalized
weakly (rgw)- Closed Sets in Topological Spaces, Int. Journal of Math. Analysis,
Vol. 6, no. 39, 1939 – 1952 (2012).
11. Savithiri D and Janaki C, .On Regular ^Generalized closed sets in topological
spaces International Journal of Mathematical Archive-4(4), 162-169 (2013).
12. Sharmistha Bhattacharya, On Generalized Regular Closed Sets, Int. J.
Contemp. Math. Sciences, Vol. 6, no. 3, 145 – 152 (2011).
13. M. Sheik John, On w-closed sets in Topology, Acta Ciencia Indica, 4, 389-
392 (2000).
14. M. Stone, Application of the theory of Boolean rings to general topology,
Trans. Amer. Math Soci, 41, 374-481 (1937).
15. Subashini Jesu Rajan, On βwg** set and Continuity in Topological Spaces,
International Journal of Computing, Vol 4 Issue 3, July (2014).
16. M.K.R.S. Veera Kumar, Between closed sets and g-closed sets, Mem. Fac.
Sci. Kochi Univ., Math. 21, 1-19 (2000).

17. M.K.R.S. Veera Kumar, g#-closed sets in topological spaces, Mem. Fac. Sci.
Kochi Univ. Ser. A. Math 24, 1-13 (2003).
18. N.V.Velicko, H-closed topological spaces. Amer. Math. Soc. Transl. 78, 103-
118 (1968).
19. M. Vigneshwaran and R. Devi, On GαO-kernel in the digital plane,
International Journal of Mathematical Archive-3(6), 2358-2373 (2012).
20. M. Vigneshwaran and A. Singaravelan, Applications of **gα-closed sets in
Topological Spaces, IJMA-5(10), 139-150 (2014).

A STUDY ON R#-CLOSED SETS IN TOPOLOGICAL SPACES
K.S.ANCHANA1 and Dr. R.S.SURIYA2
1
2
Abstract:
In this paper, a new class of closed sets called R #-closed sets in topological
spaces are introduced and studied. A subset A of topological space (X,τ) is
called R#-closed if U contains generalized closure of A whenever U contains A
and U is R*-open set in (X, τ). This new class of closed sets lies between the g-
closed sets and rg-closed sets in topological spaces. Also some of their
properties have been investigated.
Keywords: R*-closed sets, w-closed sets, rg-closed sets and R#-closed sets.
2010 Mathematics Subject Classification: 54A05, 54A10.
Introduction:
In this year 1970, Levine introduced the concept of generalized closed sets in
topological spaces. Also N. Palaniapan et al. [38], P. Sundaram et al. [44], S.S.
Benchalli et al. [7], C. Janaki et al. [19] introduced and studied regular
generalized closed sets, W-closed sets, RW-closed sets, R*-closed sets in

topological spaces respectively. In this paper an attempt is made to study a new
class of closed sets called R#-closed sets in topological spaces.
Throughout this paper (X, τ) represents non-empty topological spaces. For a
subset A of topological space (X, τ), cl(A), int(A), scl(A), αcl(A) and spcl(A)
denote the closure of A, the interior of A, the semi-closure of A, the α-closure of
A and the semi pre closure of A in a topological space X respectively. We recall
the following definitions, which are prerequisites for present study.
Preliminaries:
Definition:1.1
A subset A of a topological space (X, τ) is called a
1. Generalized closed set (g-closed) if cl(A) ⊆ U whenever A ⊆ U and U is
open in (X, τ).
2. R*-closed set if rcl(A) ⊆ U whenever A ⊆ U and U is regular semi-open
in (X, τ).
3. RW-closed set if cl(A) ⊆ U whenever A ⊆ U and U is regular semi-open
in (X, τ).
4. Generalized pre regular closed set (gpr-closed) if pcl(A) ⊆ U whenever
A ⊆ U and U is regular open in (X, τ).
5. Generalized semi pre closed set (gsp-closed) if spcl(A) ⊆ U whenever
A ⊆ U and U is open in (X, τ).

6. Regular generalized closed set (rg-closed) if cl(A) ⊆ U whenever A ⊆ U
and U is regular-open in (X, τ).
7. Regular weak generalized closed set (rwg-closed) if cl(int(A)) ⊆ U
whenever A ⊆ U and U is regular-open in (X, τ).
8. w-closed set if cl(A) ⊆ U whenever A ⊆ U and U is semi-open in (X, τ).
9. gspr-closed set if spcl(A) ⊆ U whenever A ⊆ U and U is regular-open in
(X, τ).
10. r^g-closed set if gcl(A) ⊆ U whenever A ⊆ U and U is regular-open in
(X, τ).
Definition:2.1
A subset of a space (X, 𝜏) is called R#-closed if gcl(A) ⊆ U whenever A ⊆ U
and U is R*-open in (X, τ), we use the notation R#-C(X) to denote set of all
R#-closed sets in (X, τ).
Example: 2.2
i. Let X = {a, b, c, d}, τ = {ϕ, X, {a}, {b}, {a, b}, {a, b, c}}. Then closed
sets in (X, τ) are {X, ϕ, {d}, {c, d}, {a, c}, {a, c, d}, {b, c, d}}. R#-closed
set in (X, τ) are {X, ϕ, {d}, {a, c}, {a, d}, {b, c}, {b, d}, {c, d}, {a, b, c},
{a, b, d}, {a, c, d}, {b, c, d}}. R#-open sets in (X, τ) are {X, ϕ, {a}, {b},
{c}, {d}, {a, b}, {a, c}, {a, d}, {b, c}, {b, d}, {a, b, c}}
ii. Let X = {a, b, c, d}, τ = {ϕ, X, {a}, {a, b}, {a, b, c}}. Then closed sets in
(X, τ) are {X, ϕ, {d}, {c, d}, {b, c, d}}. R#-closed set in (X, τ) are {X, ϕ,
{d}, {a, d}, {b, d}, {c, d}, {a, b, d}, {a, c, d}, {b, c, d}}. R #-open sets in
(X, τ) are {X, ϕ, {a}, {b}, {c}, {a, b}, {a, c}, {b, c}, {a, b, c}.
Theorem: 2.3
Every g-closed set in X is R#-closed set but not conversely.
Proof:
Let A be a g-closed set in topological space X. Let U be any R *-open set in X
such that A ⊆ U. Since A is g-closed, we have gcl(A) = A ⊆ U. Therefore
gcl(A) = A ⊆ U. Therefore gcl(A) = A ⊆ U. Hence A is R#-closed set in X.
Example: 2.4
Let X = {a, b, c, d}, τ = {X, ϕ, {a}, {b}, {a, b}, {a, b, c}} then the set
A = {a, c} is R#-closed set but not g-closed in X.
Corollary: 2.5
i. Every closed set is R#-closed set in X.
ii. Every regular closed set is R#-closed set in X.
iii. Every w-closed set is R#-closed set in X.
iv. Every g^-closed set is R#-closed set in X.

Proof:
i. Let A be a closed set in topological space X. Let U be any R *-open set in
X such that A ⊆ U. We know that every closed set is g-closed. Since A is
closed, we have gcl(A) = A ⊆ U. Therefore gcl(A) = A ⊆ U. Hence A is
R#-closed set in X.
ii. Let A be a regular closed set in topological space X. Let U be any
R*-open set in X such that A ⊆ U. We know that every regular closed set
is closed. Since A is regular closed, we have gcl(A) = A ⊆ U. Therefore
gcl(A) = A ⊆ U. Hence A is R#-closed set in X.
iii. Let A be a w-closed set in topological space X. Let U be any R *-open set
in X such that A ⊆ U. We know that every w-closed set is g-closed. Since
A is w-closed, we have gcl(A) = A ⊆ U. Therefore gcl(A) = A ⊆ U.
Hence A is R#-closed set in X.
iv. Let A be a g^-closed set in topological space X. Let U be any R *-open set
in X such that A ⊆ U. We know that every g^-closed set is g-closed. Since
A is g^-closed, we have gcl(A) = A ⊆ U. Therefore gcl(A) = A ⊆ U.
Hence A is R#-closed set in X.
Remark: 2.6
The converse of the above corollary: 2.5 need not be true as seen from the
following example.
Example: 2.7
Let X = {a, b, c, d}, τ = {X, ϕ, {a}, {b}, {a, b}, {a, b, c}}, A = {a, b, d} is
R*-closed set but not a closed (respectively r-closed, w-closed, g^-closed)
g^-closed in X.
Theorem: 2.8
Every R#-closed is rg-closed set in X but not conversely.
Proof:
Let A be a R#-closed set in X. Let U be any open set in X such that A ⊆ U.
Since every open set is R*-open set and A is R#-closed set, we have gcl(A) ⊆ U.
Thus gcl(A) ⊆ U, U is open in X. Therefore A is rg-closed set in X.
Example: 2.9
Let X = {a, b, c, d}, τ = {X, ϕ, {a}, {b}, {a, b}, {a, b, c}}. Then the set A = {c}
is rg-closed set but not R#-closed set in X.
Corollary: 2.10
For a topological space (X, τ) the following are hold
i. Every R#-closed set is rgb-closed set
ii. Every R#-closed set is wgrα-closed set
iii. Every R#-closed set is gpr-closed, gspr-closed, and rgβ-closed

iv. Every R#-closed set is r^g-closed and rwg-closed
Proof:
i. Let A be a R#-closed set in X. Let U be any regular open in X such that
A ⊆ U. Since every regular open set is R*-open set in X and A is
R#-closed set in X it follows that gcl(A) ⊆ U. Therefore gcl(A) ⊆ U, U is
open in X. Hence A is rgb-closed set in X.
i. Let A be a R#-closed set in X. Let U be any rα-open in X such that
A ⊆ U. Since every rα-open set is R*-open set in X and A is
regular open in X. Hence A is wgrα-closed set in X.
ii. Let A be a R#-closed set in X. Let U be any regular open in X such that
regular open in X. Hence A is gpr-closed set in X.
iii. Let A be a R#-closed set in X. Let U be any regular open in X such that
regular open in X. Hence A is gspr-closed set in X.
iv. Let A be a R#-closed set in X. Let U be any regular open in X such that

regular open in X. Hence A is rgβ-closed set in X.
v. Let A be a R#-closed set in X. Let U be any regular open in X such that
regular open in X. Hence A is r^g-closed set in X.
vi. Let A be a R#-closed set in X. Let U be any regular open in X such that
regular open in X. Hence A is rwg-closed set in X.
Remark: 2.11
The following examples are shows that the R #-closed sets are independent with
some existing closed sets in topological spaces α-closed sets, rs-closed sets,
gs-closed sets, gα-closed sets, αg-closed sets, gsp-closed sets, gp-closed sets,
g*-closed sets, wg-closed sets, rgα-closed sets, g*p-closed sets, wα-closed sets,
gwα-closed sets, R*-closed sets, rgw-closed sets, pgpr-closed sets, rps-closed
sets, gprw-closed sets, αrw-closed sets, αgp-closed sets, ps-closed sets, p-closed
sets, αgs-closed sets, g#s-closed sets, α**g-closed sets, gb-closed sets, βwg**-
closed sets, g#α-closed sets, og#p-closed sets, g*p-closed sets, g#p#-closed sets.
Example: 2.12
Let X = {a, b, c, d}, τ = {ϕ, X, {a}, {b}, {a, b}, {a, b, c}}. Then
i. α-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {c, d}, {a, c, d}, {b, c, d}}
ii. rs-closed sets in (X, τ) are {X, ϕ, {a}, {b}, {a, c}, {a, d}, {b, c}, {b, d},
{a, c, d}, {b, c, d}}
iii. gs-closed sets in (X, τ) are {X, ϕ, {a}, {b}, {c}, {d}, {a, c}, {a, d},
{b, c}, {b, d}, {c, d}, {a, b, d}, {a, c, d}, {b, c, d}}
iv. gα-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {c, d}, {a, c, d}, {b, c, d}}
v. αg-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
vi. gsp-closed sets in (X, τ) are {X, ϕ, {a}, {b}, {c}, {d}, {a, c}, {a, d},
{b, c}, {c, d}, {a, b, d}, {a, c, d}, {b, c, d}}
vii. gp-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
viii. g*-closed sets in (X, τ) are {X, ϕ, {d}, {a, d}, {b, d}, {c, d}, {a, b, d},
{a, c, d}, {b, c, d}}
ix. wg-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
x. rgα-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, b}, {c, d}, {a, b, c},
{b, c, d}}
xi. g*p-closed set in (X, 𝜏) are {X, ϕ, {c}, {d}, {a, b}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
xii. w𝛼-closed sets in (X, 𝜏) are {X, ϕ, {c}, {d}, {a, b}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
xiii. gw𝛼-closed sets in (X, 𝜏) are {X, ϕ, {c}, {d}, {a, c, d}, {b, c, d}}
xiv. R*-closed sets in (X, 𝜏) are {X, ϕ, {a, b}, {c, d}, {a, b, c}, {a, b, d},
{a, c, d}, {b, c, d}}
xv. rgw-closed sets in (X, 𝜏) are {X, ϕ, {c}, {d}, {a, b}, {c, d}, {a, b, c},
{a, b, d}, {a, c, d}, {b, c, d}}
xvi. pgpr-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {c, d}, {a, c, d}, {b, c, d}}
xvii. rps-closed sets in (X, τ) are {X, ϕ, {a}, {b}, {c}, {d}, {a, c}, {a, d}, {b,
c}, {b, d}, {c, d}, {a, c, d}, {b, c, d}}
xviii. gprw-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, b}, {c, d}, {a, b, c},
{a, b, d}, {a, c, d}, {b, c, d}}
xix. αrw-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
xx. αgp-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {c, d}, {a, c, d}, {b, c, d}}
xxi. ps-closed sets in (X, τ) are {X, ϕ, {a}, {b}, {c}, {d}, {a, c}, {a, d},
{b, c}, {b, d}, {c, d}, {a, b, c}, {a, b, d}, {a, c, d}, {b, c, d}}
xxii. p-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}

xxiii. αgs-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {c, d}, {a, c, d}, {b, c, d}}
xxiv. g#s-closed sets in (X, τ) are {X, ϕ, {a}, {b}, {c}, {d}, {a, c}, {a, d},
{b, c}, {b, d}, {c, d}, {a, c, d}, {b, c, d} }
xxv. α**g-closed sets in (X, τ) are {X, ϕ, {a, b}, {a, c}, {a, d}, {b, c}, {b, d},
{c, d}, {a, b, c}, {a, b, d}, {a, c, d}, {b, c, d}}
xxvi. gb-closed sets in (X, τ) are {X, ϕ, {a}, {b}, {c}, {d}, {a, c}, {a, d},
{b, c}, {b, d}, {c, d}, {a, b, d}, {a, c, d}, {b, c, d}}
xxvii. βwg**-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, b}, {a, c}, {a, d},
{b, c}, {b, d}, {c, d}, {a, b, d}, {a, c, d}, {b, c, d}, {a, b, c}}
xxviii. g#α-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {c, d}, {a, c, d}, {b, c, d}
xxix. og#p-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
xxx. g*p-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, b, d}, {a, c, d}, {b, c, d}}
xxxi. g#p#-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, c}, {a, d}, {b, c}, {b,
d}, {c, d}, {a, c, d}, {b, c, d}, {a, b, c}, {a, b, d}}
Remark: 2.13
From the above example we proved that the following closed sets are
independent to R#-closed sets: α-closed set, rs-closed set, gs-closed set, gα-
closed set, αg*-closed set, gsp-closed set, gp-closed set, g*-closed set, wg-closed
set, rgα-closed set, g*p-closed set, wα-closed set, gwα-closed set, R#-closed
sets, rgw-closed set, pgpr-closed set, rps-closed set, gprw-closed set, αrw-closed
set, αgp-closed set, ps-closed set, p-closed set,
αgs-closed set, g#s-closed set, α**g-closed set, gb-closed set, βwg**-closed set,
og#p-closed set, g*p-closed set, g#p#-closed set.
Example: 2.14
Let X = {a, b, c, d}, τ = {ϕ, X, {a}, {b}, {a, b}, {a, b, c}}. Then
i. closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
ii. sp-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
iii. b-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
iv. swg-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
v. gwα-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
vi. rgw-closed sets in (X, τ) are {X, ϕ, {c}, {d}, {a, b}, {c, d}, {a, b, c},
{a, c, d}, {a, b, d}, {b, c, d}}
vii. pgpr-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c},{b, d}, {c, d},
{b, c, d}}
viii. rps-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
ix. βwg*-closed sets in (X, τ) are {X, ϕ, {d}, {a, d}, {b, d}, {c, d}, {a, c, d},
{b, c, d}}
**
x. gα-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
xi. gαb-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
xii. sgb-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
xiii. rg*b-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d},
{c, d},{b, c, d}}
xiv. gb-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, c, d}, {b, c, d}}
xv. swg*-closed sets in (X, τ) are {X, ϕ, {d},{a, d}, {b, d}, {c, d}, {a, c, d},
{a, b, d}, {b, c, d}}
xvi. gr-closed sets in (X, τ) are {X, ϕ, {d}, {a, d}, {b, d}, {c, d}, {a, c, d},
{a, b, d}, {b, c, d}}
xvii. rps-closed sets in (X, τ) are {X, ϕ, {d}, {a, d}, {b, d}, {c, d}, {a, c, d},
{a, b, d}, {b, c, d}}

xviii. g#α-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {a, d}, {b, d}, {c, d},
{a, c, d}, {b, c, d}}
xix. g*s-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
#
xx. gα-closed sets in (X, τ) are {X, ϕ, {b}, {c}, {d}, {b, c}, {b, d}, {c, d},
{b, c, d}}
Remark: 2.15
From the above example we proves that the following closed sets are
independent to R#-closed sets: s-closed set, sp-closed set, b-closed set, swg-
closed set, gwα-closed set, rgw-closed set, pgpr-closed set, rps-closed set,
βwg*-closed set, **gα-closed set, gαb-closed set, sgb-closed set, rg*b-closed set,
gb-closed set, swg*-closed set, gr-closed sets, rps-closed set, g#α-closed set, g*s-
closed set, #gα-closed set.

Remark: 2.16
From the above results discussion and known results we have the following
implications
rwg-closed
r-closed
rgb-closed Wgr𝛼-closed
closed r^g-closed
w-closed g-closed R#-closed sets rg-closed set gpr-closed
g^-closed rg𝛽-closed gspr-closed
p-closed, s-closed, α-closed sets, semi pre-closed sets, b-closed sets,

rs-closed sets, gs-closed sets, gα-closed sets, αg-closed sets, gsp-closed sets,
gp-closed sets, g*-closed sets, swg-closed sets, wg-closed sets,
rgα-closed sets, g*p-closed sets, wα-closed sets, gwα-closed sets,
R*-closed sets, rgw-closed sets, pgpr-closed sets, rps-closed sets,
gprw-closed sets, αrw-closed sets, αgp-closed sets, βwg*-closed sets,
**
gα-closed sets, gαb-closed sets, sgb-closed sets, rg*b-closed sets,
ps-closed sets, αgs-closed sets, g#s-closed sets, α**g-closed sets,
g**-closed sets, gb-closed sets, swg*-closed sets, gr-closed sets, rps-closed sets,
βwg**-closed sets, g#α-closed sets, g*s-closed sets, #gα-closed sets, s#gα-closed
* # #
sets,
s g p-closed sets, gps-closed sets, g p -closed sets.
Notations:
A B means the set A implies the set B but not conversely
A B means the set A and the set B are independent of each other.
Theorem: 2.17
The union of any two R#-closed sets of X is R#-closed sets.
Proof:
Let A and B are the R#-closed sets in topological space (X, 𝜏). Let U be R*-open
set in X such that A∪B ⊆ U, then A ⊆ U and B ⊆ U, since A and B are the
R#-closed sets, gcl(A) ⊆ U, gcl(B) ⊆ U, and we know that
gcl(A)∪gcl(B) = gcl(A∪B) ⊆ U. Therefore A∪B is R#-closed set in X.
Remark: 2.18
The intersection of two R#-closed sets of topological space (X, 𝜏) is generally
not a R#-closed set in X.
Example: 2.19
Let X = {a, b, c, d} and τ = {X, ϕ, {a}, {b}, {a, b}, {a, b, c}} then the set
A = {a, c} and B = {a, d} are R#-closed set in X, but A∩B = {a} is not
R#-closed set in X.
Theorem: 2.20
If a subset A of topological space (X, 𝜏) is a R# -closed set in X then gcl(A)-A.
doesnot contain any non empty R∗ -closed set in X.

Proof:
Let A be a R# -closed set in X and suppose F be a non empty R∗ -closed subset of
gcl(A) − A, F ⊆ gcl(A) – A
⇒ F ⊆ gcl(A) ∩ (X – A)
⇒ F ⊆ gcl(A) → (1) and F ⊆ (X – A)
⇒ A ⊆ X – F and X – F is R*-open set and A is an R#-closed set,
gcl(A) ⊆ X – F
⇒ F ⊆ X – gcl(A) → (2)
From the equation (1) and (2) we get F ⊆ gcl(A) ∩ (X – gcl(A)) = ∅
⇒ F = ∅ thus gcl(A) – A does not contain any non empty R*-closed set in X.
Remark: 2.21
The converse of the above Theorem: 2.17 need not be true as seen from the
following example: 2.20
Example: 2.22
Let X = {a, b, c, d} and τ = {X, ϕ, {a}, {a, b}, {a, b, c}} then the set A = {a},
gcl(a) = {a, c}, gcl(A) – A = {a} – {a, c} = {c} does not contain any non empty
R*-closed set in X but A is not R#-closed set.

Theorem: 2.23
If A is an R#-closed set in (X, τ) and A ⊆ B ⊆ gcl(A) then B is also R#-closed
set in X.
Proof:
If it is given that A is R#-closed set in X then we have to prove that B is also
R#-closed set in X. Let U be an R*-open set of X such that B ⊆ 𝑈. Since A ⊆ B
and A is R#-closed, gcl(A) ⊆ U and A ⊆ U. Now B ⊆ gcl(A) ⇒ gcl(B) ⊆
gcl(gcl(A)) = gcl(A) ⊆ U. Therefore gcl(B) ⊆ U. Hence B is R#-closed setin X.
Remark: 2.24
The converse of the above theorem: 2.20 need not to be true as seen from the
following example: 2.23
Example: 2.25
Let X = {a, b, c} and τ = {X, ϕ, {a}, {b}, {a, b}, {a, b, c}} then set A = {c, d},
B = {a, c, d} such that A and B are R #-closed set in X, but A ⊆ B and B is not a
subset of gcl(A), because gcl(A) = {c, d}.
Theorem: 2.26
Let A be a R#-closed set in X. Then A is g-closed if and only if gcl(A) – A is
R*-closed.
Proof: Necessity: Suppose A be a g-closed set in X then gcl(A) = A that is
gcl(A) –A = ∅ which is R*-closed set.
Sufficiency: Suppose A is R#-closed in X and gcl(A) – A is R*-closed from
theorem 2.20 then gcl(A) – A = ∅ ⇒ gcl(A) = A. Therefore A is g-closed.
Theorem: 2.27
Let A ⊆ Y ⊆ X, (X, τ) and (Y, σ) are topological spaces. If A is R#-closed set in
(X, τ). Then A is R#-closed relative to (Y, σ).
Proof:
Let A ⊆ Y ∩ G, where G is R*-open. Since A is R#-closed set in X. Then A ⊆ X
and gcl(A) ⊆ G this implies that Y ∩ gcl(A) ⊆ Y ∩ G where Y ∩ gcl(A) is g-
closed set of A in Y. Thus A is R#-closed set relative to Y.
Theorem: 2.28
i. If A is regular-open and rg-closed set in (X, τ) then A is R#-closed set in
(X, τ).
ii. If A is g-open and rg-closed set in (X, τ) then A is R#-closed set in (X, τ).
iii. If A is regular open and rwg-closed set in (X, τ) then A is R#-closed set in
(X, τ).
iv. If A is regular open and gpr-closed set in (X, τ) then A is R#-closed set in
(X, τ).
v. If A is regular open and r^g-closed set in (X, τ) then A is R#-closed set in
(X, τ).
vi. If A is regular open and βwg**-closed set in (X, τ) then A is R#-closed set
in (X, τ).
Proof:
i. Let A be a regular open and rg-closed set in X. Let U be any R*-open set
in X such that A ⊆ U. Since A is regular open and rg-closed in X by
definition: 2.1 gcl(A) ⊆ A ⊆ U. Hence A is R#-closed set in X.
ii. Let A be a g-open and rg-closed set in X. Let U be any R*-open set in X
such that A ⊆ U. Since A is g-open and rg-closed in X by definition: 2.1
gcl(A) ⊆ A then gcl(A) ⊆ A ⊆ U. Hence A is R#-closed set in X.
iii. Let A be a regular open and rwg-closed set in X. Let U be any R*-open
set in X such that A ⊆ U. Since A is regular open and rwg-closed in X by
definition: 2.1 cl(int(A)) ⊆ A we know that cl(int(A)) ⊆ cl(int(cl(A))) ⊆
A ⊆ U. Then gcl(A) ⊆ U. Hence A is R#-closed set in X.
iv. Let A be a regular open and gpr-closed set in X. Let U be any R*-open set
in X such that A ⊆ U. Since A is regular open and gpr-closed in X by
definition: 2.1 pcl(A) ⊆ A then we know that pcl(A) ⊆ gcl(A) ⊆ A.
Hence gcl(A) ⊆ U. Hence A is R#-closed set in X.
v. Let A be a regular open and rg^-closed set in X. Let U be any R*-open set
in X such that A ⊆ U. Since A is regular open and rg^-closed in X by

definition: 2.1 gcl(A) ⊆ A then gcl(A) ⊆ A ⊆ U. Hence A is R#-closed
set in X.
vi. Let A be a regular open and βwg**-closed set in X. Let U be any R*-open
set in X such that A ⊆ U. Since A is regular-open and βwg**-closed in X
by definition: 2.1 gcl(A) ⊆ A then gcl(A) ⊆ A ⊆ U. Hence A is R#-
closed set in X.
Remark: 2.29
If A is both semi-open and R#-closed set in (X, τ), then A need not be g^-closed
in general as seen from the following example: 2.28.
Example: 2.30
Consider X = {a, b, c, d} and τ = {X, ϕ, {a}, {a, b}, {a, b, c}}, A = {a, c, d} is
both semi-open and R#-closed but it is not g^-closed set.
Theorem: 2.31
If A is both open and g-closed set in X then A is R#-closed set in X.
Proof:
Let A be open and g-closed in X. Let U be any R*-closed set in X such that
A ⊆ U, by definition cl(A) ⊆ A ⊆ U and gcl(A) = A. This implies that
cl(A) ⊆ gcl(A) ⊆ A ⊆ U. Hence gcl(A) ⊆ U. Therefore A is R#-closed set in X.

Theorem: 2.32
If a subset A of a topological space X is both regular open and R #-closed set in
X then it is g-closed set in X.
Proof:
Suppose a subset A of a topological space X is regular open and R #-closed as
every regular open is R*-open now A ⊆ A then by definition of R#-closed,
gcl(A) ⊆ A and also A ⊆ gcl(A) then gcl(A) = A. Hence A is g-closed set in X.
Reference:
1. S.P.Arya &T.M.Nour, characterization soft
normalspaces,IndianJ.pureApplication.Math21(1990), 717-719.
2. Ahmad Al-Omariand, Mohd. Salmiand Md. Noorani, OnGeneralized
b-Closed Sets, Bull. Malays.Math. Sci. Soc. (2) 32(1)(2009), 19–30
3. K. Alli, A. Subramanian and S. Pious Missier, g#p#-closed sets in
topological spaces, International Journal of Mathematics and Soft
Computing Vol.3, No.3. (2013), 55- 60.
4. D.Andrijevi´c,Onb-opensets,Mat.Vesnik48(1996),no.1–2,59–64.
5. D.Andrijevic,Semi-preopensets,Mat.Vesnik,38(1)(1986),24-32.
6. M.AnithaandP.Thangavelu,OnPre-Generalizedpre-
regularclosedsets,ActaCienciaIndica,31M(4) (2005),1035 – 1040

7. S.S. Benchalli andR.S. Wali, On RW-closedsets in topological
spaces, Malays. Math. sci. Soc.30 (2007),99-110
8. S.S.Benchalli,P.G.PatilandT.D.Rayanagaudar,ωα-
ClosedsetsisTopologicalSpaces,TheGlobal.J. Appl. Math. and Math.
Sci 2, 53-63
9. Sharmistha Bhattacharya, On Generalized Regular Closed Sets, Int.
J. Contemp. Math. Sciences, Vol. 6, 2011, no. 3, 145 – 152
10. P.BhattacharyyaandB.K.Lahiri,Semi-
generalizedclosedsetsintopology,IndianJ.Math.,29(1987),376-382
11. D.E.Cameron,Propertiesofs-
closedspacesProc.Amer.Math.Soc.,72(1978),581-586.
12. R. Devi, H. Maki, V. Kokilavani, The group structure of #gα-closed
sets in topological spaces, International Journal of General Topology,
2 (2009), 21-30.
13. C. Dhanapakyam, J. Subashini and K. Indirani,ON- βwg* set and
continuity in topologicalspaces, IJMA-5(5), 2014, 222-233.
14. J.Dontchev,Ongeneralizingsemi-
preopensets,Mem.Fac.Sci.KochiUniv.Ser.A.Math.,16(1995),35-48.
15. Y.Gnanambal,Ongeneralizedpre-
regularclosedsetsintopologicalspaces,IndianJ.PureAppl.Math.,28
(1997), 351-360
16. Pauline Mary Helen. M, Veronica Vijayan, Ponnuthai Selvarani,

17. g**-closed sets in topological spaces, IJMA 3(5), (2012), 1-15
18. K Indirani and G Sindhu, On Regular Generalized Star B closed sets,
IJMA. International Journal of general topology, 2(1)(2009), 21- 30
19. D.IyappanandN.Nagaveni,Onsemigeneralizedb-closedset, Int.
JournalofMath.Analysis, Vol.6, 2012, no. 26, 1251 –
1264C.JanakiandRenuThomas,OnR*closedsetsintopologicalspaces,IJ
MA-3(8),2012,3067-3074.
20. C.Janaki, Studies on лg -closed sets in Topology, Asian Journal of
Current Engg and Maths Volume 1, (5), (2012), 241-246.
21. A.Jayalakshmi&C.Janaki,Onwgrα-
ClosedSetsinTopologicalSpaces,InternationalJournalof Mathematical
Archive-3(6), 2012, 2386-2392.
22. V.KokilavaniandM.VivekPrabu,Semi#GeneralizedαClosedSets
andSemi#Generalizedα-Homeomorphism in Topological spaces,
Proceedings of National Conference on Recent Advances in
Mathematical Analysis and Applications –NCRAMAA-2013, 153-161.
23. N.Levine,Semi-opensetsandsemi-
continuityintopologicalspaces,Amer.Math.Monthly,70(1963),36-41.
24. H.Maki, R.Devi and K.Balachandran, Associated topologies of
generalized -closed sets and generalized closed sets, Mem. Fac.

Sci. Kochi Univ. Ser. A. Math., 15 (1994), 51-63.
25. H.Maki, R.Devi and K.Balachandran, generalized -closed sets in
topology, Bull.Fukuoka Univ.Ed. Part III, 42(1993), 13- 21.
26. H.Maki, J.umehra and T Noiri, Every topological space is pre-T1/2
mem.Fac.Sci.Kochi univ.Ser.A.math, 17 (1996) 33-42.
27. K. Mariappa, S. Sekar, On Regular Generalized b Closed Set, Int.
Journalof Math. Analysis, Vol. 7, 2013, no. 13, 613 – 624. Math.
Soc., 41 (1937), 374-481.Mathematical Analysis and Applications
NCRAMAA-(2013),
153-161
28. SanjayMishra,NitinBhardwajandVarunJoshi,OnRegularGeneralized
weakly(rgw)-ClosedSetsin Topological Spaces, Int. Journal of Math.
Analysis, Vol. 6, 2012, no. 39, 1939 – 1952
29. Sanjay Mishra, Nitin Bhardwaj and Varun Joshi, On Generalized Pre
Regular Weakly (gprw)-Closed Sets in Topological Spaces,
International Mathematical Forum, Vol. 7, 2012, no. 40,1981-1992
30. P.RajeswariandL.Senthilkumar,Regularweakelygeneralizedclosedset
s,Int.J.ComputerApplications (0995-8887), Vol 43-no 18, April
2012.
31. C. Mukundhan and N. Nagaveni, Weaker Formof a Generalized
Closed Set, Int. J. Contemp. Math. Sciences, Vol. 6, 2011, no. 20,
949 - 961
32. A.S. Mashour M.E Abd EI-Mansef and S.N.EI-Deeb, on pre-
continuous and weak pre-continuous mappings, proc-math.
soc.Egypt 53(1982), 47-53.
33. A. Narmadha, N. Nagaveni and T. Noiri, On regular b-Open Sets in
Topological Spaces Int. Journal of Math. Analysis, Vol. 7, 2013, no.
19, 937 – 948.
34. N.Nagavenistudiesongeneralizationofhomeomorphismintopologicals
pacesPhD,thesisBharthierUniversity, Coimbatore (1999).
35. G.B.NavalagiandChandrashekarappa,Ongsprclosedsetsintopologicalspa
ces,Vol.2,Nos1-2,(2010),
pp.51-58.
36. G.B. Navalagi, S.V. Gurushantanavar, and Chandrashekarappa A.S,
on generalized preclosed sets in topological spaces, International
Journal of Mathematics and Computing Applications, Vol. 2, Nos 1-
2, January-December 2010, pp. 35-44.
37. K.Nono, R.Devi, M.Devipriya, K. Muthukumaraswamy and H.
Maki, On g #α-closed sets and the Digital Plane, Bull. Fukuoka
Univ. Ed. Part III, 53(2004), 15-24.
38. N.PalaniappanandK.C.Rao,regulargeneralizedclosedsets,Kyungpook,M
ath.J.,33(1993),211-219.
39. Y.Palaniappan,OnRegularGeneralizedβ-
ClosedSets,InternationalJournalofScientific&Engineering Research,
Volume 4, Issue 4, April-2013 1410.
40. J.H. Park, J.K.Park mildly generalized closed sets, almost normal and
mildly normal spaces, chaos, solutions and Fractals 20(2004), 1103-
1111.
41. RajamaniM., Viswanathan K, On αgs-closed sets in topological
spaces,ActaCiencia Indica, Vol. 1, 2005,pp, 293-303.
42. Sampoornam,GnanambalIlangoandN.Selvanayaki,GeneralizedPre-
SemiClosedSetsinTopological Spaces, International Journal of
Mathematical Archive-4(6), 2013, 151-154
43. SavithiriD and Janaki C, .On regular^ generalized Closed
SetsinTopologicalSpaces, InternationalJournalof Mathematical
Archive-4(4), 2013, 162-169.
44. P.SunadaramandM.SheikJohn,OnwclosedsetsinTopology,ActaCienciaI
ndica,4(2000),389-392.
45. T. Shyla Isac Mary and P. Thangavelu, On Regular Pre-Semiclosed
sets in topological spaces, InternationalJournal of General Topology
Vol. 4, Nos. 1-2 January-December 2011, pp. 17–26.
46. Subashinijesurajan,Onβwg**setandContinuityinTopologicalSpaces,Res
earchGate,ArticleJuly2014.
TheGlobal.J.Appl.Math.andMath.Sci.2,2009,53-63.
47. A. Vadivel and K. Vairamanickam, rgα-Closed Sets and rgα-Open
Sets in Topological Spaces, Int. Journal of Math. Analysis, Vol. 3,

2009, no. 37, 1803 – 1819.
48. M.K.R.S.Veerakumar,g#-
closedsetsintopologicalspaces,Mem.Fac.Sci.KochiUniv.Ser.A.Math2
4 (2003), 1-13.
49. M.K.R.S.Veerakumar,betweenclosedandg-
closedsets.Mem.Fac.Sci.Kochiuniv,Math.21(2000)1-19.
50. M.K.R.S.VeeraKumar,Presemiclosedsets,Indian,J.Math.44(2)2002,165-
181.
51. M.K.R.S.VeeraKumar,Ong^closedsetsintopologicalspaces,BulletinAl
lahabadMath.Soc.18(2003),99-112
52. M.K.R.S.Veerakumar,g*preclosedsetsActaCienciaIndica(Mathemati
cs)Meerut,Vol.1,2002,51–60.
53. M.K.R.SVeerakumar,g#semiclosedsetsintopologicalspaces.Internatio
nalJournalofScientific&Research Publications, Vol 2,Issue 6, June
2012. ISSN 2250-3153.
54. N.V.Velicko,Hclosedtopologicalspaces.Amer.Math.Soc.Transl.78(1968
),103-118.
55. M. Vigneshwaran and A. Singaravelan,Applications of **gα-closed
sets in Topologica Spaces, IJMA-5(10), 2014, 139-150
56. L.Vinayagamoorthi,N.Nagaveni,Ongeneralized-
αbclosedsets,ProceedingICMDAllahabad,PusphaPublication Vol.1.
2010-11.Vol.3, No.3, (2013), 55-60
57. M. Stone, Application of the theory of Boolean rings to general
topology, Trans.Amer.Math.Soc., 41(1937), 374-481.
58. N.levine,GeneralizedclosedsetsinTopology,Rend.Circ.Mat.Palermo,19(
2)(1970),89-96.
59. O.Njastadonsomeclassesofnearlyopensets,paificJ.math15(1965),961-
970.

Dharshu Con Merged

Uploaded by

Copyright:

Available Formats

You might also like

Dharshu Con Merged

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Dharshu Con Merged

Uploaded by

Copyright:

Available Formats

FUZZY GRAPH COLORING AND ITS APPLICATION

Key words: Fuzzy graphs, Fuzzy chromatic number

The α– cut set of fuzzy set of fuzzy graph defined as 𝐺 = (𝑉 , 𝐸 )where 𝑉 = {v 𝜖 𝑉 : σ ≥ α }

Two vertices u and v in G are adjacent if [σ(u) ∧ σ(v)] ≤ µ(u, v)

A fuzzy graph is said to be complete if µ(u, v) = σ(u) ∧ σ(v) ∀ u, v 𝜖 V

Given a graph G : (V, E), a coloring function is mapping C : V → N identifying C (i) as

So 𝐸 . = {𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 , 𝑒 }. Here we need minimum 6 color to proper

For α = 0.5, 𝜒 . = χ(𝐺 . ) = 6

For α = 0.6, 𝜒 . = χ(𝐺 . ) = 3.

For α = 0.7, 𝜒 . = χ(𝐺 . ) = 3.

For α = 0.9, 𝜒 . = χ(𝐺 . ) = 1.

Let 𝐺 = {(V, 𝐸 ) : α 𝜖 I} be the family of α – cuts of 𝐺 , where the α – cuts of a

α 𝐸 χ cα(14) cα(15) cα(16) cα(24) cα(25) cα(26) cα(34) cα(35) cα(36)

𝜒 ՛ = {(1, 0.8) (2, 0) (3, 0.4)}. Hence the chromatic number is 𝜒 ՛ = 3.

2.3 Fuzzy total coloring using α – cuts:

Let 𝐺 = {(V, 𝐸 ) : α 𝜖 I} be the family of α – cuts of 𝐺 , where the α – cuts of a fuzzy

Since Δ = 3, the chromatic number is 𝜒 = 5. And the total chromatic number

Dr. D. Jeya Jothi

Abstract: Let G = (V, E) be a simple graph. A decomposition { , , … , } of G is said to

2. Continuous Monotonic Tree Decomposition of Graphs

Figure 2.1: Continuous monotonic tree decomposition of Peterson graph.

In this section we investigate Continuous Monotonic Tree Decomposition of

Theorem 3.1: Every Complete graph , n ≥ 2 admits CMTD.

Theorem 3.3: Let , n ≥ 2 admits CMTD, then it has (n – 1) bags.

Table 3.6: Continuous monotonic tree decomposition of .

Complete graph CMTD Strictly binary tree Binary tree bags

R. ANUSHA¹, Dr. R.S. SHEEBA²

¹II M.sc. Mathematics, Sree Ayyappa College for Women, Chunkankadai.

The converse of the above theorem need not be true.

Consider 𝐺 ∗ = (𝑉, 𝐸) where 𝑉 = {𝑣1 , 𝑣2 , 𝑣3 } and 𝐸 = {𝑣1 𝑣2 , 𝑣1 𝑣3 }. Define 𝐺 = (𝜎 𝜇) by

[1] K. Atanassov, Intutionistic Fuzzy Sets: Theory and Applications, Physica-Verlag,

G.ABISHA1 and Dr.R.S.SURIYA2

Sree Ayyappa College for Women, Chunkankadai

The concept of mean labeling was induced by Somasundaram and Ponraj

three graceful labeling. As an analogue Jayanthi and Maheswari [21] introduced

[21], where only partial results are obtained.

modulo three mean graphs.

The graph labeling is an assignment of integers to the vertices or edges

labeling). By a graph G, we mean a graph G = ( ) with | | and

of labeling and called this labelling as graceful labeling.

Labeled graphs serve as useful models for a broad range of applications

such as x-ray crystallography, radar, coding theory, astronomy, circuit design

and communication network addressing. Particularly, interesting applications of

graph labeling can be found in [2-5].

Somasundaram and Ponraj [25-26] have introduced the notation of mean

labeling of a graph. A graph G is said to have a mean labeling if there is

when each edge is labeled with if is even and

if is odd then the resulting edge labels are distinct. A

graph that admits a mean labeling is called a mean graph.

Vaidha [30-33] and et al. have investigated several familes of mean

labeling to -super mean, -super mean, -super edge mean and -

-odd mean and -odd mean graphs.

Different kinds of mean labeling are studied by Gayathri and Gopi in

graceful labeling. As an analogue, Jayanthi and Maheswari [21] introduced one

obtained in [21], where only partial results are obtained.

A graph G = is said to be one modulo three mean graph if there

is a function from the vertex set of G to the set

{0, 1, 3, 4, 6, 7,…, 3 3, 3 2} with is one-one and induces a bijection

from the edge set of G to the set {1, 4, 7, 10,…, 3 5, 3 2} where