On Study of Some Concepts in Nano Continuity via Graph Theory

Abstract

The purpose of this paper is to introduce a nano-topological space via graph theory which depends on a neighborhood between the vertices based on undirected graph with example. The Concept of Continuity was generalized via graph in order to obtain more of characterization which is application in the graph, we also introduced the concept of nano-dense via graph theory with an example and theorem. At last the concept of homeomorphism was introduced with some examples and theorem.

Share and Cite:

Khalifa, W.R. and Jasim, T.H. (2021) On Study of Some Concepts in Nano Continuity via Graph Theory. Open Access Library Journal, 8, 1-9. doi: 10.4236/oalib.1107568.

1. Introduction

L. Thivagar [1] introduced the concept of nano topological spaces which was defined in terms of approximations and boundary region of a subset of a universe using an equivalence relation on it and also defined nano closed sets, nano interior and nano closure. L. Thivagar [2] introduced a new class of functions on nano-topological spaces called nano continuous functions and derived their characterizations in terms of nano closed sets, nano closure and nano-interior. Atef [3] and Ibrahem [4] studied the relationship between topology and the graph. The two scientists Thivagar [5] and Abd El-Fattah [6] also studied nano-topological via graph theory, where he studied neighborhood between the vertices based on directed graph. In our paper we presented a definition of the nano-topological via graph theory, where he studied is neighborhood between the vertices and we studied in our paper an undirected graph theory, also, new class nano continuous function via graph theory.

2. Preliminaries

Definition 2.1: [7] [8]

“A graph G is a pair (V, E), where V is nonempty set called vertices or nodes and E is 2-element subsets of V called Edges or links”.

Definition 2.2: [7] [8]

“Let G = ( V , E ) be a graph; we call H a subgraph of G if V ( H ) V ( G ) and E ( H ) E ( G ) , in which case we write H G ”. A simple graph G in which each pair of distinct vertices is a complete graph we denote the complete graph on vertices by kn and has n ( n 1 ) / 2 edges.

Definition 2.3: [7] [8]

Two graphs G1 and G2 are isomorphic if there is a one-one correspondence between the vertices of G1 and those of G2 such that the number of edges joining any two vertices of G1 is equal to the number of edges joining the corresponding vertices of G2.

Definition 2.4: [1] [9]

“Let U be a non empty finite set of objects called the universe and R be an equivalence relations on U named as indiscernibility relation. Elements belonging to the same equivalence class are said to be indiscernible with one other. The pair ( U , R ) is said to be approximation space. Let X U .

1) The lower approximation of X with respect to R is the set of all objects, which can be certain classified as X with respect to R and is defined by L R [ x ] = { R ( x ) : R ( X ) X } where R(x) denotes the equivalence class determined by X.

2) The upper approximation of X with respect to R is the set of all objects, which can be possibly classified as X with respect to R and is defined by U R [ V ( H ) ] = x U { R ( x ) : R ( x ) X } .

3) The boundary region of X with respect to R is the set of all objects, which can be classified as X neither as X nor as not-X with respect to R and is defined by B R ( x ) = U R ( x ) L R ( x ) ”.

Definition 2.5: [1] [9]

“Let U be the universe and R be an equivalence relation on U and τ R ( X ) = { U , , L R ( x ) , U R ( x ) , B R ( x ) } . Where X U , then τ R ( X ) satisfies the following axioms:

1) U and τ R ( X ) .

2) The union of elements of any sub collection of τ R ( X ) is in τ R ( X ) .

3) The intersection of the elements of any finite sub collection of τ R ( X ) is in τ R ( X ) .

That is τ R ( X ) forms a topology on U called as the nano topology on U with respect to X. We call ( U , τ R ( X ) ) as the nano-topological space. The elements of τ R ( X ) are called as Nano open set”.

Definition 2.6: [1] [9]

“If ( U , τ R ( X ) ) is a nano topological space with respect to X and if A U , then the nano interior of A is defined as the union of all nano open subsets of A and it is denoted by N I n t ( A ) That is, N I n t ( A ) is the largest nano open subset of A. The nano closure of A is defined as the intersection of all nano closed sets containing A and it is denoted by N C l ( A ) . That is, N C l ( A ) is the smallest nano closed set containing A”.

Definition 2.7: [5]

Let G = ( V , E ) be a graph, v V ( G ) . Then the neighborhood of v and denote that Ɲ(v) were defined by Ɲ ( v ) = { v } { u V ( G ) : v u ¯ E ( G ) } .

Definition 2.8: [5]

Let G = ( V , E ) be a graph, H be a subgraph from G, Ɲ(v) is neighborhood of v in V ( G ) ; Then

1) The lower approximation L : P ( V ( G ) ) P ( V ( G ) ) is

L N [ V ( H ) ] = v V ( G ) { v : Ɲ ( v ) V ( H ) } .

2) The upper approximation U : P ( V ( G ) ) P ( V ( G ) ) is

U N [ V ( H ) ] = v V ( G ) { N ( v ) : Ɲ ( v ) V ( H ) } .

3) The boundary region is B N [ V ( H ) ] = U N [ V ( H ) ] L N [ V ( H ) ] .

3. Nano Topological Space via Graph Theory

In this section we have studied the concept of nano topological space via graph theory with example.

Definition 3.1:

“Let G = ( V , E ) , Ɲ ( v ) is neighborhood of v in V, H be a subgraph from G τ N [ V ( H ) ] = { V ( G ) , , L N [ V ( H ) ] , U N [ V ( H ) ] , B N [ V ( H ) ] } . Forms a topology on V ( G ) called nano-topology on V ( G ) with respect to V ( H ) . ( V ( G ) , τ N [ V ( H ) ] ) is called nano-topological graph”.

Example 3.2:

“Let G = ( V , E ) be a graph (see Figure 1). Then, Ɲ ( v 1 ) = { v 1 , v 4 } , Ɲ ( v 2 ) = { v 2 , v 3 } , Ɲ ( v 3 ) = { v 2 , v 3 , v 4 } , Ɲ ( v 4 ) = { v 1 , v 3 , v 4 } . H is a subgraph with vertices V ( H ) = { v 2 , v 3 } , then L N [ V ( H ) ] = { v 1 } , U N [ V ( H ) ] = { v 1 , v 3 , v 4 } , B N [ V ( H ) ] = { v 3 , v 4 } . Therefore, the nano-topology from G will be τ N [ V ( H ) ] = { V ( G ) , , { v 2 } , { v 2 , v 3 , v 4 } , { v 3 , v 4 } } .

Figure 1. Simple graph (nano-topology test of connected graph without cycle).

4. Nano Continuity via Graph Theory

In this section we studied the concept nano continuity via graph theory with some characterization, examples and proofs.

Definition 4.1:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) . Then the mapping f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is called nano-continuous on V ( G 1 ) if the inverse image from each nano-open set in V ( G ) is nano-open in V ( G 1 ) .

Example 4.2:

Let G 1 = ( V 1 , E 1 ) , G 2 = ( V 2 , E 2 ) be two isomorphic graphs (see Figure 2). Then there exists a function f : V ( G 1 ) V ( G 2 ) as f ( v 1 ) = u 2 , f ( v 2 ) = u 3 , f ( v 3 ) = u 4 , f ( v 4 ) = u 1 . We a construct nano-topology on G 1 . Assume that H is a subgraph from G 1 with vertices V ( H ) = { v 1 , v 2 , v 4 } .

Then Ɲ ( v 1 ) = { v 1 , v 2 , v 4 } , Ɲ ( v 2 ) = V ( G ) , Ɲ ( v 3 ) = { v 2 , v 3 , v 4 } , Ɲ ( v 4 ) = V ( G ) . Since, L N [ V ( H ) ] = { v 1 } , U N [ V ( H ) ] = V ( G ) , B N [ V ( H ) ] = { v 2 , v 3 , v 4 } . Then the nano-topological graph from V ( H ) are τ N ( V ( H ) ) = { V ( G 1 ) , , { v 1 } , { v 2 , v 3 , v 4 } } .

We a construct nano-topology on G 2 generated by f ( V ( H ) ) = { u 1 , u 2 , u 3 } .

Assume that W is a subgraph from G 2 with vertices V ( W ) = { u 2 , u 4 } . Then, Ɲ ( u 1 ) = V ( G ) , Ɲ ( u 2 ) = { u 1 , u 2 , u 3 } , Ɲ ( u 3 ) = V ( G ) , Ɲ ( u 4 ) = { u 1 , u 3 , u 4 } . Since, L N [ V ( H ) ] = { u 2 } , U N [ V ( H ) ] = V ( G ) , B N [ V ( H ) ] = { u 1 , u 3 , u 4 } . Then, the nano-topological graph from f ( V ( H ) ) are τ N ( f ( V ( H ) ) ) = { V ( G 2 ) , , { u 2 } , { u 1 , u 3 , u 4 } } . Then, f 1 { u 1 , u 3 , u 4 } = { v 2 , v 3 , v 4 } , f 1 { u 2 } = { v 1 } Therefore, f is nano continuous.

Theorem 4.3:

“Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) .

A function f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is nano continuous if and only if the inverse image of every nano closed set in V ( G 1 ) is nano closed in V ( G ) ”.

Proof:

“Let f be nano continuous and V ( F ) be nano closed in V ( G 1 ) . That is, V ( G 1 ) V ( F ) is nano-open in V ( G 1 ) . Since f is nano continuous,

f 1 ( V ( G 1 ) V ( F ) ) is nano-open in V ( G ) . That is, V ( G ) f 1 ( V ( F ) ) is

Figure 2. Two isomorphic graphs (the continuity test of nano topological space via graph theory).

nano-open in V ( G ) . Therefore, f 1 ( V ( F ) ) is nano closed in V ( G ) . Thus, the inverse image of every nano closed set in V ( G 1 ) is nano closed in, if f is nano continuous on V ( G ) . Conversely, let the inverse image of every nano closed set be nano closed. Let V ( H ) be nano-open in V ( G 1 ) . Then V ( G 1 ) V ( H ) is nano closed in V ( G 1 ) . Then, f 1 ( V ( G 1 ) V ( H ) ) is nano closed in V ( G ) . That is, V ( G ) f 1 ( V ( H ) ) is nano closed in V ( G ) . Therefore, f 1 ( V ( H ) ) is nano-open in V ( G ) . Thus, the inverse image of every nano-open set in V ( G 1 ) is nano-open in V ( G ) . That is, f is nano continuous on V ( G ) ”.

Theorem 4.4:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) . A function f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is nano continuous if and only if f ( N C l G ( V ( H ) ) ) N C l G ( f ( V ( H ) ) ) for every subgraph H of G.

Proof:

“Let f be nano continuous and V ( H ) V ( G ) . Then f ( V ( H ) ) V ( G 1 ) . N C l G ( f ( V ( H ) ) ) is nano closed in V ( G 1 ) . Since f is nano continuous, f 1 ( N C l G ( f ( V ( H ) ) ) ) is nano closed in V ( G ) . Since f ( V ( H ) ) N C l G ( f ( V ( H ) ) ) , V ( H ) f 1 ( N C l G ( f ( V ( H ) ) ) ) . Thus f 1 ( N C l G ( f ( V ( H ) ) ) ) is a nano closed set containing V ( H ) . But, N C l G ( V ( H ) ) is the smallest nano closed set containing V ( H ) . Therefore, N C l G ( V ( H ) ) f 1 ( N C l G ( f ( V ( H ) ) ) ) . That is, f ( N C l G ( V ( H ) ) ) N C l G ( f ( V ( H ) ) ) .

Conversely, let f ( N C l G ( V ( H ) ) ) N C l G ( f ( V ( H ) ) ) for every subgraph V ( H ) of V ( G ) . If V ( F ) is nano closed in V ( G 1 ) , since f 1 ( V ( F ) ) V ( G ) , f ( N C l G ( f 1 ( V ( F ) ) ) ) N C l G ( f ( f 1 ( V ( F ) ) ) ) N C l G ( V ( F ) ) .

That is, C l G ( f 1 ( V ( F ) ) ) f 1 ( N C l G ( V ( F ) ) ) = f 1 ( V ( F ) ) , since V ( F ) is nano closed. Thus N C l G ( f 1 ( V ( F ) ) ) f 1 ( V ( F ) ) But, f 1 ( V ( F ) ) N C l G ( f 1 ( V ( F ) ) ) . Therefore, N C l G ( f 1 ( V ( F ) ) ) = f 1 ( V ( F ) ) . Therefore, f 1 ( V ( F ) ) is nano closed in V ( G ) for every nano closed set V ( F ) in V ( G 1 ) . That is, f is nano continuous”.

Theorem 4.5:

“Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) . A function f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is nano continuous if and only if N C l G ( f 1 ( V ( H ) ) ) f 1 ( N C l G ( V ( H ) ) ) for every subgraph H of G”.

Proof:

“If f is nano continuous and V ( H ) V ( G 1 ) , N C l G ( V ( H ) ) is nano closed in V ( G 1 ) and hence f 1 ( N C l G ( V ( H ) ) ) is nano closed in V ( G ) . Therefore, N C l G ( f 1 ( N C l G ( V ( H ) ) ) ) = f 1 ( N C l G ( V ( H ) ) ) . Since V ( H ) N C l G ( V ( H ) ) f 1 ( V ( H ) ) f 1 ( N C l G ( V ( H ) ) ) . Therefore, N C l G ( f 1 ( V ( H ) ) ) N C l G ( f 1 ( N C l G ( V ( H ) ) ) ) = f 1 ( N C l G ( V ( H ) ) ) . That is, N C l G ( f 1 ( V ( H ) ) ) f 1 ( N C l G ( V ( H ) ) ) .

Conversely, assume that N C l G ( f 1 ( V ( H ) ) ) f 1 ( N C l G ( V ( H ) ) ) for every V ( H ) V ( G 1 ) . Let V ( H ) be nano closed in V ( G 1 ) . Then N C l G ( V ( H ) ) = V ( H ) . By Assumption, N C l G ( f 1 ( V ( H ) ) ) f 1 ( N C l G ( V ( H ) ) ) = f 1 ( V ( H ) ) . Thus, N C l G ( f 1 ( V ( H ) ) ) f 1 ( V ( H ) ) . But, f 1 ( V ( H ) ) N C l G ( f 1 ( V ( H ) ) ) . Therefore, N C l G ( f 1 ( V ( H ) ) ) = f 1 ( V ( H ) ) . That is, f 1 ( V ( H ) ) is nano closed in V ( G ) for every nano closed set V ( H ) in V ( G 1 ) . Therefore, f is nano continuous on V ( G ) ”.

Theorem 4.6:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) . A function f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is nano continuous on V ( G ) if and only if f 1 ( N I n t G ( V ( H ) ) ) N I n t G ( f 1 ( V ( H ) ) ) for every subgraph H of G 1 .

Proof:

Assume that f is nano continuous and V ( H ) V ( G 1 ) , N I n t G ( V ( H ) ) is nano open in ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) and hence f 1 ( N I n t G ( V ( H ) ) ) is nano open in ( V ( G ) , τ N ( V ( H ) ) ) . Therefore, f 1 ( N I n t G ( V ( H ) ) ) = N I n t G ( f 1 ( N I n t G ( V ( H ) ) ) ) . Since N I n t G ( V ( H ) ) V ( H ) f 1 ( N I n t G ( V ( H ) ) ) f 1 ( V ( H ) ) . Therefore, N I n t G ( f 1 ( N I n t G ( V ( H ) ) ) ) N I n t G ( f 1 ( V ( H ) ) ) = f 1 ( N C l G ( V ( H ) ) ) . That is f 1 ( N I n t G ( V ( H ) ) ) N I n t G ( f 1 ( V ( H ) ) ) .

Conversely, assume that f 1 ( N I n t G ( V ( H ) ) ) N I n t G ( f 1 ( V ( H ) ) ) for every V ( H ) V ( G 1 ) . If V ( H ) be nano open in V ( G 1 ) . N I n t G ( V ( H ) ) = V ( H ) . By assumption, N I n t G ( f 1 ( V ( H ) ) ) N I n t G ( f 1 ( V ( H ) ) ) . That is, f 1 ( V ( H ) ) N I n t G ( f 1 ( V ( H ) ) ) . But, N I n t G ( f 1 ( V ( H ) ) ) f 1 ( V ( H ) ) . Therefore, f 1 ( V ( H ) ) = N I n t G ( f 1 ( V ( H ) ) ) . That is, f 1 ( V ( H ) ) is nano open in V ( G ) for every nano open set V ( H ) in V ( G 1 ) . Therefore, f is nano continuous.

Definition 4.7:

Let G = ( V , E ) be a graph with nano-topological graph ( V ( G ) , τ N ( V ( H ) ) ) . If W G is said to be nano-dense if N C l G ( V ( W ) ) = V ( G ) .

Example 4.8:

From example 4.2. Assume that H is a subgraph from G 1 with vertices V ( H ) = { v 1 , v 2 , v 4 } . Then Ɲ ( v 1 ) = { v 1 , v 2 , v 4 } , Ɲ ( v 2 ) = V ( G ) , Ɲ ( v 3 ) = { v 2 , v 3 , v 4 } , Ɲ ( v 4 ) = V ( G ) . Since, C ( Ɲ ( v 1 ) ) = { v 3 } , C ( Ɲ ( v 2 ) ) = , C ( Ɲ ( v 3 ) ) = { v 1 } , C ( Ɲ ( v 4 ) ) = . Then, C ( Ɲ ( v 3 ) ) V ( H ) . Therefore, N C l G ( V ( H ) ) = U N [ V ( H ) ] { v 3 } = V ( G 1 ) . Hence N C l G ( V ( H ) ) = V ( G 1 ) .

Theorem 4.9:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) and f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) be an onto and nano continuous function, V ( H ) V ( G ) . If V ( H ) is nano dense in V ( G ) , then f ( V ( H ) ) is nano dense in V ( G 1 ) .

Proof:

“Since V ( H ) is nano dense in V ( G ) , N C l G ( V ( H ) ) V ( G ) . Then f ( N C l G ( V ( H ) ) ) f ( V ( G ) ) = V ( G 1 ) , since f is onto and nano continuous on V ( G ) , f ( N C l G ( V ( H ) ) ) N C l G ( f ( V ( H ) ) ) . Therefore, V ( G 1 ) N C l G ( V ( H ) ) but N C l G ( V ( H ) ) V ( G 1 ) . Therefore, N C l G ( V ( H ) ) = V ( G 1 ) . That is f ( V ( H ) ) is dense in V ( G 1 ) . Thus, a nano continuous function maps nano dense sets into nano dense sets, provided it is onto”.

5. Nano Homeomrphism via Graph Theory

In this section we studied of nano homeomorphism in the graph with some examples and proofs.

Definition 5.1:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) . A function f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is nano-open map if the image of every nano-open set in V ( G ) is nano open in V ( G 1 ) . The mapping f is said to be a nano closed set map if the image of every nano-closed set in V ( G ) is nano closed in V ( G 1 ) .

Theorem 5.2:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) A mapping f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is nano closed map if and only if N C l G ( f ( V ( H ) ) ) f ( N C l G ( V ( H ) ) ) , for every subgraph H G .

Proof:

If f is nano closed, f ( N C l G ( V ( H ) ) ) is nano closed in V ( G 1 ) , since N C l G ( V ( F ) ) is nano closed V ( G ) . Then, V ( H ) N C l G ( V ( H ) ) , f ( V ( H ) ) f ( N C l G ( V ( H ) ) ) . Thus, f ( N C l G ( V ( H ) ) ) is a nano closed set containing f ( V ( H ) ) . Therefore, N C l G ( f ( V ( H ) ) ) f ( N C l G ( V ( H ) ) ) .

Conversely, if V ( F ) is nano closed in V ( G ) , then N C l G ( V ( F ) ) = V ( F ) and hence f ( V ( F ) ) N C l G ( f ( V ( F ) ) ) f ( N C l G ( V ( F ) ) ) = f ( V ( F ) ) . Thus, V ( F ) = N C l G ( V ( F ) ) . That is, f ( V ( F ) ) is nano closed in V ( G 1 ) . Therefore, f is nano closed map.

Theorem 5.3:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) , ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) A mapping f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is nano open map if and only if f ( N I n t G ( V ( H ) ) ) N I n t G ( f ( V ( H ) ) ) , for every subgraph H G .

Proof: It’s clear by theorem

Definition 5.4:

Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) . Then the mapping f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is called nano-homeomorphism if

1) f is one to one and onto.

2) f is nano-continuous.

3) f is nano-open.

Example 5.5:

From Example 4.2. Assume that H is a subgraph from G with vertices V ( H ) = { v 1 , v 2 , v 4 } . Then the nano-topological graph from V ( H ) and f ( V ( H ) ) are τ N ( V ( H ) ) = { V ( G 1 ) , , { v 1 } , { v 2 , v 3 , v 4 } } . τ N ( f ( V ( H ) ) ) = { V ( G 2 ) , , { u 2 } , { u 1 , u 3 , u 4 } } . Then the function f : ( V ( G 1 ) , τ N ( V ( H ) ) ) ( V ( G 2 ) , τ N ( f ( V ( H ) ) ) ) is nano-homeomorphism.

Theorem 5.6:

“Let G = ( V , E ) and G 1 = ( V 1 , E 1 ) be any two isomorphic graphs with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) and f : ( V ( G ) , τ N ( V ( H ) ) ) ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is one-one and onto. Then f is a nano homeomorphism if and only if f is nano closed and nano continuous”.

Proof:

“Let f is a nano homeomorphism. Then f is nono continuous. Let V ( F ) be an arbitrary nano closed set in ( V ( G ) , τ N ( V ( H ) ) ) . Then V ( G ) V ( F ) is nano open, since f is nano open, f ( V ( G ) V ( F ) ) is nano open V ( G 1 ) . That is, V ( G 1 ) f ( V ( F ) ) is nano open in V ( G 1 ) . Therefore, f ( V ( F ) ) is nano closed in V ( G 1 ) . Thus, the image of every nano closed set in V ( G ) is nano closed in V ( G 1 ) . That is f is nano closed.

Conversely, let f is nano closed and continuous. Let V ( H ) be a nano open set in ( V ( G ) , τ N ( V ( H ) ) ) . Then V ( G ) V ( H ) is nano closed in V ( G ) , since f is nano closed, f ( V ( G ) V ( H ) ) = V ( G 1 ) f ( V ( H ) ) is nano closed in V ( G 1 ) . Therefore, f ( V ( F ) ) is nano open in V ( G 1 ) . Thus, f is nano open and hence f is a nano homeomorphism”.

Theorem 5.7:

Let G = ( V , E ) , G 1 = ( V 1 , E 1 ) with nano topological graph ( V ( G ) , τ N ( V ( H ) ) ) . A one-one f of ( V ( G ) , τ N ( V ( H ) ) ) onto ( V ( G 1 ) , τ N ( f ( V ( H ) ) ) ) is a nano homeomorphism iff f ( N C l G ( V ( H ) ) ) N C l G ( f ( V ( H ) ) ) for every subgraph H of G.

Proof:

If f is a nano homeomorphism, f is nano continuous and nano closed. If V ( H ) V ( G ) , f ( N C l G ( V ( H ) ) ) N C l G ( f ( V ( H ) ) ) , since f is nano continuous. Then N C l G ( V ( H ) ) is nano closed in V ( H ) and f is nano closed, f ( N C l G ( V ( H ) ) ) is nano closed in V ( G 1 ) . N C l G ( f ( N C l G ( V ( H ) ) ) ) = f ( N C l G ( V ( H ) ) ) . Since V ( H ) N C l G ( V ( H ) ) , f ( V ( H ) ) f ( N C l G ( V ( H ) ) ) and hence N C l G ( f ( V ( H ) ) ) N C l G ( f ( N C l G ( V ( H ) ) ) ) = f ( N C l G ( V ( H ) ) ) . Therefore, N C l G ( f ( V ( H ) ) ) f ( N C l G ( V ( H ) ) ) . Thus, f ( N C l G ( V ( H ) ) ) = N C l G ( f ( V ( H ) ) ) if f a nano homeomorphism.

Conversely, if V ( H ) is nano-closed in V ( G ) . N C l G ( V ( H ) ) = V ( H ) which implies f ( N C l G ( V ( H ) ) ) = f ( V ( H ) ) . Therefore, N C l G ( f ( V ( H ) ) ) = f ( V ( H ) ) , thus V ( H ) is nano closed in V ( G 1 ) , for every nano closed set V ( H ) in V ( G ) . That is f is nano closed. Also f is nano continuous. Thus, f is a nano homeomorphism.

6. Conclusion

In this paper, the relationship between nano topology and graph theory was studied to show how nano topology is deduced from any graph as explained in Section 3. We also deduced the concepts of continuity and homeomorphism in nano topology and their relationship with two isomorphic graphs as explained in Section 4 and Section 5.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] Thivagar, M.L. and Richard, C. (2013) On Nano Forms of Weakly Open Sets. International Journal of Mathematics and Statistics Invention, 1, 31-37.
[2] Thivagar, M.L. and Richard, C. (2013) On Nano Continuity, Mathematical Theory and Modeling, 3, 32-37.
[3] Atef, M. (2018) Some Topological Applications on Graph Theory and Information Systems'. Master thesis, University of Menoufia, Egypt.
[4] Ibrahem, A. (2020) On Topological Graph Theory. Master Thesis, University of Mosul, Iraq.
[5] Lellis Thivagar, M., Manuel, P. and Sutha Devi, V. (2016) Adetection for Patent Infringement Suit via Nanotopology Induced by Graph. Cogent Mathematics, 3, 1-10. https://doi.org/10.1080/23311835.2016.1161129
[6] Nasef, A. and El-Atik, A.F. (2017) Some Properties on Nano Topology Induced by Graphs. AASCIT Journal of Nanoscience, 3, 19-23.
[7] Chartrand, G., Lesniak, L. and Zhang, P. (2016) Textbooks in Mathematics “Graphs and Digraphs”'. Taylor and Francis Group, LLC, California.
[8] Diestel, R. (2000 'Graph Theory. Springer-Verlag Heidelberg Press, New York.
[9] Thivagar, M.L. and Richard, C. (2017) Note on Nano Topological Spaces. (Communicated)

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.