Abstract
The objective of this research is to describe and investigate a novel class of separation axioms and discuss some of their fundamental characteristics using a nano weakly generalized closed set. In nano topological space, -closed graph and strongly -closed graph functions are introduced and explored. We also analyse some of the characterizations of closed graph functions with the separation axioms via a nano weakly generalized closed set.
MSC Classification:
54B10; 54C10; 54C35; 54D10
1. Introduction
The concept “closed sets” in general topology is important, and many topologists are currently focusing their research in this area. Topologists have developed generalizations for this concept, leading to the discovery of interesting results. One of the most well-known concepts and sources of inspiration is the notion of the g-closed set, which was first proposed by Levine [1]. In 1969, Long [2] discussed properties induced by functions with closed graphs on their domain and range spaces. Subsequently, Long and Herrington [3] defined strongly closed graphs in 1975. Based on this, in 1978, Noiri [4] examined functions with strongly closed graphs. Then, in 2009, Noiri and Popa [5] investigated generalized closed graphs and strongly generalized closed graphs. Lellis Thivagar [6] introduced nano topological space using an equivalence relation on the boundary area of a universal set and its approximations. Weakly generalized closed sets and weakly generalized closed graphs were defined in topological space by Nagaveni et al. [7,8,9], who also expanded their research into nano topological spaces.
In 2016, Lellis Thivagar et al. [10] defined the concept of nano topological space using general graphs. Arafa et al. (2020) [11] introduced a new method for generating nano topological spaces using the vertices of a graph. A novel approach for creating a nano topological structure using the ideas of the graph’s boundary, closure and interior was also introduced. Using nano continuity, Atik et al. [12,13] examined the isomorphisms between simple graphs. Khalifa et al. (2021) [14] introduced a nano topological space based on graph theory that depends on neighbourhood relationships between the vertices within an undirected graph, illustrated with examples. The idea of continuity has been generalized through graph theory to provide additional characterizations and is applicable to simple graphs.
In this article, we define and analyse the characterizations of -closed graph and strongly -closed graph functions using nano weakly generalized closed sets. We also examined the relationships of strongly -closed graphs with -irresolute, nano quasi -irresolute, nano θ-irresolute, etc. We extensively explored this concept and ascertained that those functions with strongly -closed graphs are a stronger notion than -closed graphs. We investigated some separation properties induced by closed graph functions on their domain, range, or both spaces. We discuss an example of -closed graphs using graph theory, which depends on neighbourhood relationships between vertices in a simple graph.
In this article, , ) and represent two nano topological spaces (NTSs) with respect to and , where and is an equivalence relation defined on the set , and / denotes the collection of equivalence classes of by 1. Similarly, is an equivalence relation on , and / denotes the collection of equivalence classes of induced by 2.
2. Preliminaries
Descriptions of some of the terminologies used in this sequel are provided in this section.
Definition 1.
([6]). Let be a non-empty finite set of objects called the universe and be an equivalence relation on , referred to as the indiscernibility relation. The pair (, ) is said to be the approximation space. Let . The lower approximation, upper approximation and boundary of the region of with respect to is defined as and , where denotes the equivalence class determined by ∈ . Then, the nano topology (NT) is defined on The satisfies the following axioms:
- (i)
- ∈ .
- (ii)
- The union of the elements of any subcollection of is in .
- (iii)
- The intersection of the elements of any finite subcollection of is in We call , a nano topological space (briefly NTS).
Definition 2.
([7]). Let , be a nano topological space. Subset of , is referred to as a nano weakly generalized closed set (briefly ) if Cl(Int()) ⊆ , where ⊆ and is nano open. The complement of the -closed set is an -open set (briefly -). The family of all nano weakly generalized open sets is denoted by We set Similarly, the family of all nano weakly generalized closed sets is denoted by We set The closure of a subset of is denoted by -Cl(). Similarly, the interior of subset of is denoted by -Int().
Definition 3.
([7]). The function is termed as follows:
- (i)
- is continuous on if the inverse image of every nano closed set in is nano weakly generalized closed in .
- (ii)
- is irresolute on if the inverse image of every -closed set in is nano weakly generalized closed in .
- (iii)
- is closed (open) on if the image of every nano closed (open) set in is an Nwg closed (open) set in .
Definition 4.
([5]). Let be a function between two topological spaces,. Then, the subset of the product space is known as the graph ofand is written by .
Definition 5.
([2]). A function is said to have a closed graph (resp. strongly closed graphs) if for each there exist open sets and containing , respectively, such that .
Lemma 1.
([2]). Let be a function, and then the graph is closed (resp. strongly closed) for graphs in there exist open sets and containing , respectively, such that
Definition 6.
([11]). Let a graph and ; then .
Definition 7.
([11]). Let be a graph with vertices, S be a subgraph of and the neighbourhood of is represented by and . Then
Definition 8.
([11]). Let a graph and , be a neighbourhood of and a subgraph S of and then forms a topology called NTS on with respect to We call as the NTS induced by a graph.
Definition 9.
([15]). According to graph theory, the graph that has two vertices (u, u′) and (v, v′) adjacent in G □ H is a graph such that u = v and u′ is adjacent to v′ in H, or u′ = v′ and u is adjacent to v in G. Furthermore, the vertex set of G □ H is the Cartesian product V(G) × V(H).
3. Separation Axioms via Nano Weakly Generalized Closed Set
In this section, we explore the characterization of separation axioms with the aid of an -open set in an NTS.
Definition 10.
The space, is defined as follows:
- -T0 space (-Kolmogorov space) if for and - such that
- -T1 space (-Fréchet space) if for and . - and such that and .
- -T2 space (-Harsdorf space) if for and . disjoint - and such that .
- - space (-Urysohn space) if for and . disjoint - and , such that -- .
Theorem 1.
Every - space is an - space.
Proof.
Let and . Since is the - space, there exists disjoint -OSs ⊂ and ⊂ , , such that --. Hence, Therefore, is an - space. □
Theorem 2.
Every - space is an -1 space.
Proof.
Let and . The is - space, and there exists disjoint -s ⊂ and ⊂ , such that --. This indicates that -- Now -- Therefore, -- such that -- Thus, is an - space. □
Example 1.
If ,{}}, then - are { Thus, in , , there exists disjoint-s, ⊂ and such that -- . Therefore, is an - space, and -T2, -T1 and -T0 space.
Theorem 3.
Every open subspace of the -T2space is -T2space.
Proof.
Let be an Suppose , is the subspace of . Let be two distinct points in S. Since and are also points of , which is given to be the -T2 space, two disjoint - and , such that G contains and H contains . Then, the sets = S1, S2 are disjoint - in S contains S1 and S2, such that S1 ∩ S2 = . Hence, S is the -T2 space. □
Theorem 4.
If is the -irresolute mapping and is the -T0 space, then is -T0.
Proof.
Let ∈ with ≠ and be an -T0 space. Then, - P of , such that either and with . By using the injective -irresoluteness of , is an - of such that either or . Therefore, is an -T0 Space. □
Lemma 2.
If the bijection function is the -open, then for any , (.
Proof.
The proof is obvious. □
Lemma 3.
Let and A ⊂ The point -Cl(A) if and only if AS for all S
Proof.
The proof is obvious. □
Theorem 5.
If is the bijective -open mapping and is the- space, then is - space.
Proof.
Let , and . Since is the bijection, and The space property of provides the existence of sets with the fact that -- . By the Lemma 3, - is the - in . By the Lemma 2, bijectivity and -openness reveals that (-()) ∈ (). Again, from ⊂ -(), it follows that () ⊂ (-()). Since -clousure respects inclusion, -(()) ⊂ -((-()) = (-()). In like manner, -(f(N)) ⊂ (-(N)). Therefore, by the injectivity of , - (()) ⋂ - (()) ⊂ (-()) ⋂ ( -()) =[(-()) ⋂ (-())] = () = . Thus, the -openness of gives the existence of two sets, () ∈ (, ), () ∈ (, ) with - (()) ⋂ -(()) = . Hence, is - space. □
4. Discussion on Nano Weakly Generalized Closed Graphs
In this section, we introduce a weaker form of the closed graph, such as -closed graphs, with the aid of -in an NTS and investigate the functions and characterization of separation axioms along with -closed graphs. The example of the -closed graph via a simple graph with vertices is discussed.
Definition 11.
The function is told to have a nano weakly generalized closed graph (briefly -) if for each () -open sets and , ,
Lemma 4.
If is the function, then the graph is - in () a -open set and , , such that
Proof.
Necessity: Since has a nano weakly generalized closed graph, for each such that a - and , , in such a way that . This implies that
Sufficiency: Consider and then there are two - and , such that . This indicates that. As a result, has an -. □
Example 2.
If , then the-open sets are }. If, , then the -open sets are {, Let be a mapping defined by , and Therefore, has -. □
Example 3.
In this example, we observed that an-closed graph will be induced by a general graph with vertices. The two distinct graphs are and , their vertices of are = {} and = and the vertices of the Cartesian product of two graphs are {, , , , , , , , , , , , , , , , , , , , , , , }; this is shown inFigure 1.
The neighbourhoods of the vertices of are N() = {, N() = {, N() = {, N() = {. If the subgraph of G such that V( then { and an NTS -open sets are .
Similarly, the neighbourhoods of the vertices of are N() = , N() = , N() = . Assume that is a subgraph of H such that V( = . So, = ,) = and the NTS , The -open sets are . The neighbourhoods of the vertices of are
- N(, , , , }, N(, = {, , , , , N(, , , , , }, N(,N() = {}, N() = {, , N() = {}, N() = {, }, N() = {, N() = { }, N() = {}, N() = {}.
- Consider the subgraph of such that V( = { = {, , } and ) = {,, } and a NTS ( = { { { , , }, {,, }}.
- If the function is defined by , and then has -. □
Theorem 6.
If the function an injective with the -, then is -T1 space.
Proof.
Let and Since is an injection, But is the -, so that using the Lemma 4, - and , , such that Thus, ∉ . Likewise, -P and Q containing and in such a way that As a result, ∉ P. is -1 space. □
Theorem 7.
If the function surjective with respect to the - then is -T1 space.
Proof.
Consider and . Given the function is onto, a point in such that = . Hence, ∉ using the Lemma 4, there is - and , because of which Further, it implies ∉ . Likewise, there exist Thus, ∉ Similarly, there exist - , , such that Hence, ∉ Q, and thus the space is -T1 space. □
Corollary 1.
If the bijective function has the -CG , then both and are -T1 space.
Proof.
That is obvious from Theorems 6 and 7. □
Theorem 8.
If the -open and onto function with the - then is -2 space.
Proof.
Let and . The points , and Since is -CG, there exist -OSs , and , as a result of which However, is -open and contains . Therefore, is -T2 space. □
Theorem 9.
If injective and -continuous with - and also is -2 space, then is -2 space.
Proof.
Let be any two of points, Then, such that Since the function is -continuous, are -open in , . By the -2 space, we obtain Thus, is -T2 space. □
Theorem 10.
If the function is the -homeomorphism with -CG G(), then and are -2 space.
Proof.
It is implied by Theorems 8 and 9. □
5. Stronger Form of Nano Weakly Generalized Closed Graphs
We present a stronger form of the closed graph, such as strongly -closed graphs with the aid of -closed sets in an NTS examined with strongly -closed graphs with -irresolute, nano quasi -irresolute, nano θ- -irresolute, etc.
Definition 12.
The function is called strongly - if for each () an - and , and ,-
Lemma 5.
Let be the function. The graph is strongly -closed in a - and , and such that - =
Proof.
The proof is evident from Definition 12. □
Example 4.
Let , - are . Let , and-be {, . Let be a mapping defined by and Then, has strongly -closed graph. □
Remark 1.
The previous example is -. But Example 2 is not strongly -. Thus, strongly - is -. The converse, however, is not necessarily true. □
Theorem 11.
If is -irresolute and is -, then G() is strongly -.
Proof.
Let Since is - space, there exist ∈ (, ) such that ) ∉ -. Then, - ∈ (, )). Since is -irresolute, there exist M ∈ (, ) such that ⊆ -. Then, - Hence, G() is strongly -. □
Theorem 12.
If one to one and G() is strongly -, then is -T1 space.
Proof.
Given that is one to one, ∈ and , () ≠ (). Since G() is strongly -closed, as per Definition 12, (, ) ∈ , a - and , and , and thus () ∩ -= Therefore, ∉ . Consequently, a - W contains (), ∉ W. As a result, is -T1. □
Theorem 13.
If surjection along with strongly -, then is both -T2 and -T1 space.
Proof.
Let . Since is surjective, there exist such that () = . Since G() is strongly -, by the Lemma 5 (, ) ∈ , there is an - and , and hence -() = As a result, ∉ -(). This implies that ∈ (, ), W ⋂ = ∅. Thus, is -T2. Thus, is -T1 space. □
Theorem 14.
If one to one and onto with strongly -, then and are -T1 spaces.
Proof.
Theorems 12 and 13 directly lead to the proof. □
Theorem 15.
The space is -T2 space if and only if the identity function has strongly -.
Proof.
Necessary: Consider to be -T2. According to Theorem 11, the identity function is -irresolute, and G() is strongly -.
Sufficiency: Let G () be strongly -. Since the function is onto using Theorem 13, is -2 space. □
Definition 13.
A function is called nano quasi -irresolute if ∈ and for each - is a subset of , a - , in such a way that () ⊂ - □
Remark 2.
Every -irresolute is nano quasi -irresolute. However, the contrary is not always true, as demonstrated by the given example. □
Example 5.
Let , -open sets are. Let, and -open sets are {, . Let be a mapping defined by and Then is nano quasi -irresolute. However, in , is not - in . As a result, is not -irresolute function. □
Theorem 16.
If is nano quasi -irresolute, a one-to-one function along with strongly -G(), then is -T2 space.
Proof.
Since is one to one, for any two separate points ∈ , () ≠ (). Therefore (, ()) ∈ . The - closedness of G() gives ∈ (, ) and ∈ (, ()) such that () ⋂ -() = . Therefore, we obtain ⋂ (-()) = . Consequently, (-()) ⊂ . Since is nano quasi - irresolute, this is applicable at . Then there exists W ∈ (, ) in such a way that (W) ⊂ -(). It follows that W ⊂ (-()) ⊂ . Thus, it may be shown that W ⋂ = . As a result of this, is a -T2 space. □
Theorem 17.
If is a nano weakly generalized Urysohn space and is nano quasi -irresolute, then is -T2 space.
Proof.
As the function is one to one, ∈ ≠ , () ≠ (). The nano weakly generalized Urysohn property implies that there exist ∈ (, ()), such that -() ⋂ -() = . Hence, (-()) ⋂ (-()) = . Since is nano quasi -irresolute, there exists ∈ (, ), such that () ⊂ -(), . Then, it follows that ⊂ (-()), . Hence, ⋂ ⊂ (-() ⋂ (-()) = . This implies that is -T2 space. □
Definition 14.
A function is called nano θ--irresolute if for each -neighbourhood of () there is a -neighbourhood of such that (- ()) ⊆ -().
Remark 3.
Every -irresolute function is nano θ--irresolute. However, as the following example demonstrates, the contrary need not be true.
Example 6.
Let , -open sets be. Let , . -open sets are {, Let be a mapping defined by , and Then, is nano θ--irresolute. Nonetheless, in is not -. Thus, is not an -irresolute function.
Corollary 2.
If is nano θ--irresolute, a one-to-one function with strongly -CG G(), then is -T2 space.
Proof.
Given that nano θ--irresoluteness is nano quasi -irresoluteness, Theorem 16 provides the basis for the proof. □
Theorem 18.
If the bijective function is nano quasi -irresolute (resp. nano θ--irresolute) with strongly -G(), then and are -T2 space.
Proof.
The proof is a direct result of Theorem 16 and Theorem 13 (resp. Corollary 2 and Theorem 13). □
Corollary 3.
If is -irresolute, a one-to-one function with - , then is -T2 space.
Proof.
Theorem 16 as well as the fact that every -irresoluteness is nano quasi -irresoluteness provide the proof. □
Definition 15.
A function is almost -irresolute if for each and each -neighbourhood of ), -Cl( is the -neighbourhood of .
Theorem 19.
If is nano almost -irresolute, a one-to-one function with - G (), then is -T2 space.
Proof.
By using Theorem 16, we get () ⋂ -Cl () = . Therefore, (-Cl()) ⊆ – . Since is a nano -closed set containing (-Cl()), any -Cl((-Cl())) is the smallest -closed that contains (-Cl()) as the result of -Cl ((-Cl())) ⊆ . The nano almost -irresoluteness of confirms that -Cl()) and hence -Cl((-Cl())) is a - neighbourhood of . This implies that there exist ∈ (, ) such that ⊆ -Cl (( -Cl())) ⊆ . From this we can obtain ⋂ = . Therefore, is -T2 space. □
6. Conclusions
In this paper, we explored the characterization of separation axioms with the aid of - in an NTS. We presented a weaker form of a closed graph, such as -closed graphs, and a stronger form of a closed graph, such as strongly -closed graphs, with the aid of -closed sets in an NTS and examined the characterization of strongly -closed graphs with -irresolute, nano quasi -irresolute, nano θ--irresolute, etc. The example of an -closed graph via a simple graph with vertices was discussed. We investigated some separation properties, especially -Harsdorf space and -Urysohn space, induced by both closed graph functions such as -closed graphs and strongly -closed graphs either on its domain, range, or on both spaces.
Author Contributions
Writing—original draft preparation, K.K.; writing—review and editing, K.K. and S.D.; software, K.K., S.D. and S.P.S.; supervision, N.N. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Levine, N. Generalized closed sets in topological spaces. Rend. Circ. Mat. Palermo 1970, 19, 89–96. [Google Scholar] [CrossRef]
- Long, P.E. Functions with closed graphs. Am. Math. Mon. 1969, 76, 930–932. [Google Scholar] [CrossRef]
- Long, P.E.; Herrington, L.L. Functions with strongly closed graph. Boll. dell’Unione Mat. Ital. 1975, 4, 381–385. [Google Scholar]
- Noiri, T. Functions with strongly closed graph. Acta Math. Hung. 1978, 32, 1–4. [Google Scholar] [CrossRef]
- Noiri, T.; Popa, V. A generalization of some forms of g-irresolute functions. Eur. J. Pure Appl. Math. 2009, 2, 473–493. [Google Scholar]
- Thivagar, M.L.; Richard, C. On Nano Continuity. Math. Theory Model. 2013, 3, 32–37. [Google Scholar]
- Nagaveni, N.; Bhuvaneswari, M. On Nano weakly generalized closed sets. Int. J. Pure Appl. Math. 2016, 106, 129–137. [Google Scholar]
- Nagaveni, N.; Sheeba, D. Study on some topological generalized closed graph. JP J. Geom. Topol. 2017, 20, 179–195. [Google Scholar] [CrossRef]
- Nagaveni, N.; Sundaram, P. On weakly generalized continuous maps, weakly generalized closed maps and weakly generalized irresolute maps in topological space. Far East J. Math. Sci. 1998, 6, 903–912. [Google Scholar]
- Lellis Thivagar, M.; Manuel, P.; Sutha Devi, V. A detection for patent infringement suit via nano topology induced by graph. Cogent Math. 2016, 3, 1. [Google Scholar] [CrossRef]
- Arafa, N.A.; Shokry, M.; Hassan, M. From Graph Theory to Nano Topology, Faculty of Sciences and Mathematics, University of Nis, Serbia. Filomat 2020, 34, 1–17. [Google Scholar] [CrossRef]
- El-Atik, A.E.F.A.; Hassan, H.Z. Some nano topological structures via ideals and graphs. J. Egypt. Math. Soc. 2020, 28, 41. [Google Scholar] [CrossRef]
- Nawar, A.S.; El-Atik, A.A. A model of human heart via graph nano topological spaces. Int. J. Biomath. 2019, 12, 1950006. [Google Scholar] [CrossRef]
- Khalifa, W.R.; Jasim, T.H. On Study of Some Concepts in Nano Continuity via Graph Theory. Open Access Libr. J. 2021, 8, e7568. [Google Scholar] [CrossRef]
- Simon, S. Connectivity of Cartesian products of graphs. Appl. Math. Lett. 2008, 21, 682–685. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).