1. Introduction
For the first time, in 1982, Pawlak introduced the theory of rough sets [
1,
2]. The idea of rough set theory is a generalization of crisp set theory. For the study of intelligent systems characterized by inadequate and incomplete information, this theory is an extension of set theory [
3,
4,
5]. It is an effective tool for dealing with vagueness and incomplete information. In addition, rough set theory is an important mathematical approach to imprecise knowledge. Rough set theory uses a crisp set’s boundary region to represent ambiguity. A set is crisp if its boundary region is empty; otherwise, it is rough. The lower approximation and upper approximation are two approximations that are used in rough set theory to represent a subset of a universe. In rough set theory, equivalence classes are the fundamental building blocks. Classical sets can be uniquely characterized by their elements, which indicate whether or not an element is a part of the set. But in rough sets, we have some additional information related to the elements. As a result, the concept of a rough set is clear and accurate. In rough set theory, we keep elements that have the same information in one equivalence class, and with the help of these equivalence classes, we evaluate the lower and upper approximations of a set, which leads to uncertainty. The main idea of rough sets is truly based on the classification of uncertain information. As a result, rough set theory deals with imprecise data. In many cases, the equivalence relation provided in the universe is insufficient for introducing upper and lower approximation operators. Since then, the theory, as well as the extensions of the results and applications, have piqued the interest of several mathematicians, logicians, and researchers. These applications may be found in many different domains, including expert systems, data mining, and machine learning [
6,
7,
8,
9]. This theory relies on a certain topological configuration. Because it bridges the gap between topological researchers and those who pay attention to the application of topology theory, the concept of a topological rough set is an extremely significant generalization of a rough set.
The graph theory as introduced in [
10] and its general topology are two important branches of mathematics that are closely related. The relationship between graph theory and general topology includes the construction of topologies on the set of vertices and edges of a graph. Several papers employed directed and undirected graphs to construct different topologies on graphs (see [
11,
12,
13,
14,
15]). Most of these constructions were found in the theory of simple undirected graphs: that is, the sets of vertices in such graphs. A relation on a graph serves as a bridge between graph theory and topological structures.This link gives the graph additional kinds of topological structures. The article in [
16] states that the labeled transitive directed graph with
n points and the labeled topologies on
n points correspond one to one. In 2010, the paper in [
17] investigated the connection between directed graphs and finite topologies. Furthermore, the authors of [
18,
19] constructed graph grills and examined the properties of the topologies that were produced on a vertex set of graphs. Generalizations of rough sets via ideals and bi ideals are introduced in refs. [
20,
21]. In ref. [
22], it is introduced a new approach for closure spaces by relations. Some basic definitions and introductions to graph theory and rough set theory may be found in sources [
10,
13,
16,
23,
24]. A topology on the vertices of an undirected graph was proposed by the authors of [
25] in 2013. Recently, many communications between rough set theory and graph theory were proposed, which are useful in physics and medicine. In 2018, the authors of [
26] linked a vertex set of simple graphs without isolated vertices to an incidence topology. The authors of [
27] in 2018 presented a novel topology on the set of vertices of a simple graph
without isolated vertices, constructed utilizing incidence topology. The family of end sets that solely include each edge’s end points creates a sub-basis for this topology. The graph
was applied by the authors of [
28] to induce two topology constructions on the set of its edges
, which are represented by compatible edge topology and incompatible edge topology. In [
12], it was established a relation on graphs in order to generate new forms of topological structures. Similarly, in [
13], the graph ideal was created and studied in order to use graph ideals to create novel topologies on the graph’s vertex set. In [
29], an example of a real-life application using graphical topological spaces. Topology has been enriched with a variety of newly developed topics of study, and many new concepts have been introduced. To find valid properties in these topological problems, topologists have created novel structures such as closure space, proximity, and ideals [
30].
In this study, we provide new topological findings of the induced topologies on the vertex set of a general graph, continuing the evolution of the usage of general relations. With regard to the graph’s ideal closure spaces based on minimal neighborhoods, this paper is organized as follows: In
Section 2, we give a review of closure spaces on graphs with all the definitions related to this work. According to these criteria,
Section 3 examines graph accumulation points, graph dense sets, and graph nowhere-dense subgraphs. We provide several interesting graphical examples. Graph subspaces of such spaces under a graph sub ideal, defined under the specified graph ideal, are proposed and studied in
Section 4. In
Section 5, the graph separation axioms pertaining to these graph IASs are restated using relational terms. In
Section 6, we rephrase and examine connectedness in these graph IASs. Lastly, a few observations and a conclusion are provided.
2. Preliminaries
Throughout the current research, simple undirected or directed graphs with or without loops are covered. A graph is indicated by the symbol . The term “simple directed or undirected graph with or without loops” will be shortened to “graph”. More broadly, any subgraph ℶ of the graph that has the vertex set is denoted by the notation in certain places.
is a nonempty finite or infinite set, and is a set of unordered pairs of members of . A graph is represented as the pair . The sets and are the vertex and edge sets of . The empty graph is represented by the pair . A graph with no loops or numerous edges is called a simple graph. The neighbors of ⅁ (in ) are the nodes that are next to ⅁ for every node . If and then and If then and are disjoint. In the case of and we have as a subgraph of , and is a supergraph of written as .
A relation on a graph from the vertex set to (a relation on the vertex set ) is a subset of . For two vertices and , the formula is abbreviated as and means that the vertex is adjacent to the vertex , and the vertex is said to be adjacent to the vertex . If the graph is undirected, then the relation can be written as Also, the afterset of is and the foreset of is In this paper, refers to a closure space or graph approximation space (graph AS, for short) on graph . Also, the triple refers to a graph ideal approximation space (graph IAS, for short) on a graph .
Definition 1 ([
23])
. Assume that Ξ is a binary relation on a graph Ω. The intersection of all aftersets containing the vertex ⅁ is the set , and it is given byAlso, is the intersection of all foresets containing the vertex ⅁, i.e., Definition 2 ([
23])
. Assume that Ξ is a binary relation on a graph Ω. For any subgraph ℶ of Ω, a pair of lower and upper approximations, and , are defined by the following: Theorem 1 ([
23])
. The following properties are valid for the upper approximation defined by (2).- (1)
- (2)
for
- (3)
- (4)
- (5)
, where denotes the usual complement of the vertex set and equals .
The operator
on
is said to be a
closure operator, and
is called a
closure space. Further, it generates a topology on
denoted by
and defined by
Definition 3 ([
13])
. Consider a graph . The collection is , where is said to be a graph ideal on a graph topological space if it satisfies the following three conditions:- (1)
- (2)
If is a subgraph of and the graph , then .
- (3)
If and then .
Example 1. Assume that Ω
is the graph where and The drawing of the graph Ω
is given in Figure 1. For the graph in Figure 1, we have the following: - (i)
is a graph ideal.
- (ii)
is not a graph ideal, since .
Definition 4 ([
24])
. Consider that graphs and are two subgraphs of Ω
. Assume that is a graph ideal on the graph Ω
, then the lower and upper approximations of related to , denoted by and , of are defined, respectively, by the following: Theorem 2 ([
24])
. Consider the graph and are two subgraphs of Ω
. Assume that is a graph ideal on the graph , Then, we have the following:- (1)
;
- (2)
;
- (3)
;
- (4)
implies ;
- (5)
;
- (6)
;
- (7)
Remark 1. The operator on induced a topology on the vertices of graph Ω, and it is denoted by and defined as
Definition 5 ([
24])
. Consider the graph , , and ℶ and ℸ are two subgraphs of Ω. Assume that is a graph ideal on the graph Ω; then, the lower and upper approximations of related to , denoted by and , of are defined, respectively, by the following:where Theorem 3 ([
24])
. Consider the graph , and ℶ and ℸ are two subgraphs of Ω. Assume that is a graph ideal on the graph . Then, we have the following:- (1)
;
- (2)
;
- (3)
;
- (4)
implies ;
- (5)
;
- (6)
;
- (7)
Remark 2. The operator on induced a topology on , which is denoted by and defined as . It is clear that
Lemma 1. Consider the graph . For two vertices , we have the following:
- (1)
If , then .
- (2)
If , then .
Proof. The proof is straightforward. □
3. Closure Spaces by Relations via Graph Ideals
Definition 6. Consider the graph , and ℶ is a subgraph of Ω. Assume that is a graph ideal on the graph Ω. Then, a vertex is called an accumulation point of the vertex set if . The set of all accumulation points of is denoted by , i.e., Definition 7. Consider the graph . Assume that and . Then, is called a closure subspace of a closure space , if for all
Lemma 2. Assume that is a graph IAS and ⅁ is a vertex of . Then, we have the following:
- (1)
;
- (2)
Proof. - (1)
According to Theorem 2 (3), it is noted that Conversely, we illustrate that Assume that Then, according to Lemma 1 (1), Thus, As a result, Hence, Therefore,
- (2)
The proof is similar to (1) according to Lemma 1 (2).
□
Corollary 1. Assume that is a graph IAS. Then, we have the following:
- (1)
;
- (2)
Proof. The proof is straightforward according to Theorem 2 (1) and Theorem 3 (1). □
Proposition 1. Assume that is a graph IAS. For , we have the following:
- (1)
iff , and iff ;
- (2)
iff , and iff .
Proof. (1) Assume that Then, Thus, . Conversely, let . According to Definition 4, . The proof of the second part is similar.
(2) The proof is similar to (1). □
Proposition 2. Assume that is a graph IAS and . Then, we have the following:
- (1)
;
- (2)
Proof. (1) Assume that Then, . Thus, So, Also, implies that for all . Hence,
- (2)
The proof is similar to (1).
□
Definition 8. Assume that is a graph IAS and . Then, a vertex is said to be the following:
(i) A *—graph ideal accumulation point of , if for some
The set of all *—graph ideal accumulation points of is denoted by , i.e., (ii) A —graph ideal accumulation point of , if for some
The set of all —graph ideal accumulation points of is denoted by , i.e., Lemma 3. Assume that is a graph IAS and . Then, the following is the case:
- (1)
- (2)
iff
- (3)
- (4)
iff
Proof. (1) Assume that
Then,
. Thus, we have either
i.e,
or
. So,
. In the latter case, we have
Hence,
i.e,
From (
8) and (
9),
Conversely, let
. Then, we have either
i.e,
or
. Therefore,
So,
Hence,
i.e,
From (
10) and (
11),
As a result,
(2) Assume that i.e., Then, clearly, Thus, and Conversely, let Then, by (1), .
(3) The proof is similar to (1).
(4) The proof is similar to (2). □
Theorem 4. Assume that is a graph IAS and . If then the following is the case:
- (1)
- (2)
Proof. (1) Assume that . It is clear that . Then, Therefore, So, Hence, Therefore,
(2) The proof is similar to (1). □
Lemma 4. Assume that is a graph IAS and . Then,
- (1)
If then and
- (2)
and
- (3)
and
- (4)
and .
Proof. (1) Assume that and let Then, Thus, . So, The proof of the second part is similar.
(2) Since
and
by (1), we have
Conversely, let Then, and Thus, and . So, . Hence, . The proof of the second part is similar.
(3) The proof is similar to (2).
(4) Assume that It is obvious that and . Then, . Thus, So, Hence, Therefore, The proof of the second part is similar. □
Corollary 2. Assume that is any graph IAS and . Then, we have the following: Proof. Assume that Then, Thus, . So, and where . Hence, As a result, □
Remark 3. The example that follows demonstrates that the converse of Corollary 2 is not true in general.
Example 2. Consider the graph Ω defined in Example 1. Then, the relation Ξ on the given graph has the form . Define a graph ideal on Ω as Then, Also, Thus, Consider a subset of vertices of some subgraph . Then, we have Thus, So, . On the other hand, we obtain Then, Thus Also, we have Then,
As a result, So,
Definition 9. Assume that is any graph IAS and . Then, ℶ is said to be the following:
- (i)
Graph dense, if
- (ii)
*—graph ideal dense, if
- (iii)
—graph ideal dense, if
- (iv)
Nowhere dense, if
- (v)
*—graph ideal nowhere dense, if
- (vi)
—graph ideal nowhere dense, if
Corollary 3. Assume that is any graph IAS and . Then, the following is the case:
- (1)
—graph ideal dense —graph ideal dense ⇒ graph dense;
- (2)
Nowhere dense —graph ideal nowhere dense —graph ideal nowhere dense.
Proof. (1) The proof is straightforward from Theorem 3 (3).
(2) Assume that ℶ is nowhere dense. Then, Thus, and So, ℶ is *—graph ideal nowhere dense and —graph ideal nowhere dense. □
Example 3. (1) Assume that Ω is the graph where and We represent the graph Ω in Figure 2. The relation Ξ on the above graph Ω has the form , . Define a graph ideal on Ω as Consider a subset of vertices Then, we have Thus, we obtain the following: Assume that Then, Thus, ℶ is a graph dense. But and . So, ℶ is not *—graph ideal dense. On the other hand, suppose that Then, Thus, is *—graph ideal dense. But So, ℶ is not —graph ideal dense.
Example 4. Assume that Ω is the graph where and We represent the graph Ω as given in Figure 3. The relation Ξ on the above graph Ω has the form , . Define a graph ideal on Ω as Then, we have Consider a subset of vertices Then, and Thus, So, ℶ is *—graph ideal nowhere dense. But Hence, is not graph nowhere dense. Also, suppose that Then, and Thus, So, ℶ is —graph ideal nowhere dense. But So, ℶ is not *—graph ideal nowhere dense.
Corollary 4. Assume that is a graph IAS, and ℶ is a subgraph of Ω. Then, the following is the case:
- (1)
If ℶ is graph dense, then any subgraph induced by is nowhere dense.
- (2)
If is *—graph ideal dense, then any subgraph induced by is *—graph ideal nowhere dense.
- (3)
If ℶ is —graph ideal dense, then any subgraph induced by is —graph ideal nowhere dense.
Proof. (1) Assume that ℶ is dense. Then, . Thus, and So, Hence, is nowhere dense.
(2) Assume that ℶ is *—graph ideal dense. Then, Thus, So, and Hence, is *—graph ideal nowhere dense.
(3) The proof is similar to (2). □
4. Graph Ideal Approximation Subspace
Lemma 5. If is a graph ideal on a graph Ω and then is a graph ideal on .
Proof. (i) It is obvious that .
(ii) Assume that Then, there exists such that Since is a graph ideal and , thus,
(iii) Assume that Then, there exists such that . Thus, . So, is a graph ideal on . □
Definition 10. Assume that and . Then, is called a graph ideal closure subspace of a graph ideal closure space , if for all
Lemma 6. Assume that is an ideal closure subspace of an ideal closure space Then, for all iff for all
Proof. Assume that
for all
We want to show that
for all
Then,
Conversely, suppose that
for all
Then,
Thus, we have for all □
Corollary 5. Assume that is a graph ideal closure space and Then, is a graph ideal closure subspace iff for all
Proof. The proof is directly derived from Definition 10 and Lemma 6. □
The graph ideal closure subspace is a topological space, as demonstrated by the following Lemma.
Lemma 7. A graph ideal closure subspace of a graph ideal closure space is a topological space.
Proof. All we wish to demonstrate is that the closure operator
is idempotent. Assume that
Then, we have the following
Note that Then, . Thus, is idempotent. □
Theorem 5. Assume that is a graph ideal closure subspace of a graph ideal closure space and Then, we have the following
- (1)
- (2)
and
Proof. (1) Assume that
for each
. Then,
Thus,
So,
Hence,
and
i.e.,
Conversely, let
Then,
Thus,
i.e.,
So,
Hence,
i.e.,
Therefore, from (
12) and (
13), we have
(2) Assume that Then, . Thus, So, i.e., Hence, Therefore,
On the other hand, we propose the following example. □
Example 5. Let Ω be the graph where and We represent the graph Ω as given in Figure 4. The relation Ξ on Ω is given by , Define a graph ideal on Ω as , . Define two subgraphs of Ω as and Then, we have Thus, , and So, Hence, Hence,
5. Lower Separation Axioms in Graph IASs
Definition 11. (i) A graph AS is called a graph —space if , there exists such that the following is the case: (ii) A graph IAS is called a graph -space if , there exists such that (iii) A graph IAS is called a graph —space if , there exists such that Proposition 3. For a graph IAS , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
for each
- (3)
is a graph —space for each .
Proof. (1) : Assume that (1) holds, and let Then, there exists such that Thus, So, . Hence, by Proposition 1 (1), In the same manner, we can prove that Therefore,
(2)
: Assume that (2) holds, and let
and
Then,
, and by (2),
or
Thus, by Proposition 1 (1),
or
i.e.,
So, is a —space.
(3)
: Assume that (3) holds and let
Then, there exists
such that
By (3), there exists
such that
Then,
Thus, we obtain the following:
So,
Hence we have
Therefore, is a graph —space. □
Corollary 6. For a graph AS on a graph Ω, the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
For each either or
- (3)
for each
- (4)
is a graph —space for each .
Corollary 7. For a graph IAS , the following are equivalent:
- (1)
Ω is a graph —space;
- (2)
for each
- (3)
is a graph —space for each .
Definition 12. (i) A graph AS is called a graph —space if , there exists such that the following is the case: (ii) A graph IAS is called a graph —space if , there exists such that the following is the case: (iii) A graph IAS is called a graph —space if , there exists such that the following is the case: Proposition 4. For a graph IAS , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
for each
- (3)
for each
- (4)
is a graph —space for each .
Proof. (1)
: Assume that
is graph
—space, and let
. Then, for
and
such that
Thus,
So,
i.e.,
Hence,
(2)
: Assume that (2) holds and let
Then,
, but
Thus, we have the following
(3)
: Assume that (3) holds, and let
for each
. Then, clearly,
By (3),
. According to Theorem 5 (1),
Thus,
and
i.e.,
and
So, there exist
and
such that
Hence, is a graph —space.
(4)
: Assume that (4) holds, and let
Then, clearly, there exists
such that
According to (4), there exists
such that we have the following:
Thus,
and
So, we have
Hence, is a graph —space. □
Corollary 8. For a graph AS , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
For each and
- (3)
for each
- (4)
for each
- (5)
is a graph —space for each .
Corollary 9. For an IAS , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
for each
- (3)
for each
- (4)
is a graph —space for each .
Definition 13. (i) A graph AS is called a graph —space if it satisfies the following condition: for any the following is the case: (ii) A graph IAS is called a graph -space if it satisfies the following condition: for any we have the following: (iii) A graph IAS is called a graph —space if it satisfies the following condition: for any the following is the case: Proposition 5. For a graph IAS , the following statements are equivalent:
- (1)
Ω is a graph —space,
- (2)
If , then for all
Proof. (1) : Assume that (1) holds, let ⅁, be two distinct vertices in . Then, or
In the first case, implies and
In the second case, implies and This means that and Thus, and Hence, in either case, (2) holds.
(2)
: Assume that (2) holds, and let
Then,
If
then
If
then
From (
14) and (
15), we complete the proof. □
Corollary 10. For a graph AS , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
If , then for all
Corollary 11. For a graph IAS , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
If , then for all
Definition 14. (i) A graph AS is called a graph —space if , there exists such that (ii) A graph IAS is called a graph —space if , there exists such that (iii) A graph IAS is called a graph —space if , there exists such that Theorem 6. For a graph IAS , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
for all
Proof. (1) : Assume that is a graph —space, and let . Then, there exists such that and Thus, and So, i.e., Hence, and i.e., Therefore,
(2) : Assume that (2) holds and let Then, by (2), there exists such that . Assume that . Then, (from Theorem 2 (1)), and so, Also, Thus, is a graph —space. □
Corollary 12. For a graph AS, , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
for all
Corollary 13. For a graph IAS, , the next statements are equivalent:
- (1)
Ω is a graph —space;
- (2)
for all
Corollary 14. For a graph IAS , the following holds:
- (1)
Graph-
- (2)
- (3)
Proof. The proof is immediately constructed from Definition 13, Propositions 3 and 4, and Corollaries 6–9. □
Remark 4. For a special graph or a circular graph with a proper graph ideal is not a graph - or a graph - or a graph - for
Remark 5. From Definitions 11, 12, and 14, we have the implication given in Figure 5. To demonstrate that the implication is irreversible, we present the following examples. Also, the examples show that and
Example 6. (1) Assume that Ω is the graph where and The drawing of this graph Ω is given in Figure 6. The relation Ξ on the above graph Ω has the form . Then, Thus, So, Hence, Ω is a —space. But Then, Thus, Ω is not a . Also, but Thus, Ω is not
- (2)
In (1), define a graph ideal on Ω as , Then, Thus, So, Ω is . But Then, Thus, Ω is not a . Also, but Then, Ω is not a .
- (3)
Assume that Ω is the graph where and The drawing of this graph Ω is given in Figure 7. The relation Ξ on the above graph Ω has the form , . Then, Define a graph ideal on the graph Ω as . As a result, we have the following:
(i) For , and
(ii) For and
(iii) For and
So, Ω is a . But and Then, Ω is not .
- (4)
From (3), we have the following cases:
If then . Thus,
If then Thus, .
If then Thus,
So, Ω is a . But Then, Ω is not a .
- (5)
From (3), Then, Thus, Ω is not a . But if , then and . Thus, and . So, and . Hence, Therefore, Ω is .
- (6)
From (5), Ω is , but it is not
- (7)
In (1), suppose that Then, we have the following cases:
If and for some , then and .
If then and
If , then and .
Thus, Ω is . But and . Then, Ω is not .
- (8)
In (3), Ω is not . But and Then, Ω is not .
Example 7. (1) Assume that Ω is the graph where and The drawing of this graph Ω is given in Figure 8. The relation Ξ on the above graph Ω has the form , . Then, Also, Thus, Define a graph ideal as . As a result, Hence, Therefore, Ω is . But Then, Thus, Ω is not a . Also, but Then, Ω is not .
- (2)
In (1), define a graph ideal as . Then, we have the following cases.
For and , and
For and
For and
Thus, Ω is . But Then, Ω is not .
- (3)
From (2), Ω is . But and . Then, , but Thus, Ω is not .
- (4)
Assume that Ω is the graph where and The drawing of this graph Ω is given in Figure 9. The relation Ξ on the above graph Ω has the form . Then, Also, Thus, Define a graph ideal as . As a result, we have the following:
- (i)
, i.e.,
- (ii)
, i.e.,
- (iii)
, i.e.,
Thus, Ω is a . But . Then, Hence, Ω is not a .
- (5)
According to (4), Ω is But Then, Ω is not a .
- (6)
Assume that Ω is the graph where and The drawing of this graph Ω is given in Figure 10. The relation Ξ on the above graph Ω has the form , . Then, Also, Thus, Define a graph ideal as . As a result, we have the following:
- (i)
For and i.e., and
- (ii)
For i.e., and
- (iii)
For i.e., and
Hence, Ω is a . But and Then, , but Thus, Ω is not .
Example 8. (1) Assume that is an infinite graph, and A graphical representation of the infinite graph Ω is given in Figure 11. If is the graph ideal of finite subgraphs of then Thus, , we have the following: So, Ω is a . But Ω is not , since if and then and , which is impossible because is infinite and is finite.
(2) In (1), we have the following: Then, , we have the following: Thus, Ω is and . But Ω is neither nor .
(3) In Example 6 (1), if , then and Thus, Ω is . But Ω is not , since it is not
(4) In Example 7 (4), we have and Then, Ω is a . But Ω is not , since it is not
Definition 15. Assume that and are ASs, and let be a graph ideal on Ω. Then, we have the following:
(i) A function is said to be continuous if , i.e., for all
(ii) A function is said to be *—graph continuous (resp. —graph continuous) if (resp. ), i.e., (resp. ) for all
Remark 6. From Theorem 3 (3), we have the following diagram: The following example shows that the implication in the diagram is not reversible.
Example 9. Assume that Ω is the graph , where and Also, let be the graph where and The graphical representations of the two graphs Ω and are given in Figure 12. The relation on the above graph Ω has the form , , and the relation on the graph has the form Then, Also, Thus, On the other hand, Also, So, Assume that is the mapping given by
(1) Define a graph ideal as . As a result, we have the following: Thus, f is *—graph continuous. But f is not continuous, since
(2) Consider Then, we obtain Thus, f is —graph continuous. While f is not *—graph continuous, since
Theorem 7. Assume that be an injective continuous function. Then, is a graph- if is a graph- for
Proof. Assume that is a graph - for and let in . We provide a proof for Since f is injective, in . Then, by the hypothesis, there exist such that and i.e., and Since f is continuous, Thus, , i.e., there exists in such that and So, is graph -. For the proofs are similar. □
Corollary 15. Assume that is an injective continuous function. Then, is graph - if is graph - for
6. Connectedness in Graph IASs
Definition 16. Assume that is a graph AS. Then,
(i) Two subgraphs are called graph-separated if
(ii) A subgraph is called graph-disconnected if there exist separated subgraphs such that . is said to be graph-connected (contains one component) if it is not graph disconnected (more than one component).
(iii) is called a graph-disconnected space if there exist two graph separated subgraphs such that . is called a graph connected space if it is not graph disconnected space.
Definition 17. Assume that is a graph IAS. Then, we have the following:
(i) is called a *—graph-separated (resp. —graph-separated) set if (resp. ).
(ii) is called a *—graph-disconnected (resp. —graph-disconnected) set if there exist *—graph-separated (resp. —graph-separated) subgraphs such that . is said to be *—graph-connected (resp. —graph-connected) if it is not *—graph-disconnected (resp. —graph-disconnected).
(iii) is called a *—graph-disconnected (resp. —graph-disconnected) space if there exist *—graph-separated (resp. —graph-separated) subgraphs such that . is called a *—graph-connected (resp. —graph-connected) space if it is not a *—graph-disconnected (resp. —graph-disconnected) space.
Remark 7. We propose the next diagrams: The following examples demonstrate that the implications cannot be reversed.
Example 10. Assume that Ω is the graph where and We represent the graph Ω as in Figure 13: The relation Ξ on the graph Ω has the form , . Then, , Also, Thus,
- (1)
Define a graph ideal on Ω as For we have the following: Thus, , but So, ℶ and ℸ are *—graph-separated subgraphs but are not graph-separated subgraphs.
- (2)
Define a graph ideal on Ω as For we obtain the following: Thus, , but So, ℶ and ℸ are —graph-separated subgraphs but are not *—graph-separated subgraphs.
Example 11. Assume that Ω is the graph where and We represent the graph Ω as in Figure 14. The relation Ξ on the above graph Ω has the form , . Then, Also, Thus,
- (1)
Define a graph ideal on Ω as , Then, we have the following: Thus, Ω is a graph-connected space. But we obtain So, Ω is not a *graph-connected space.
- (2)
Define a graph ideal on Ω as . Then, we obtain the following: Thus, Ω is a *—graph-connected space. But we have the following: So, Ω is not a —graph-connected space.
Proposition 6. Assume that is a graph IAS. Then, the next statements are equivalent:
- (1)
Ω is *—graph connected;
- (2)
For each with and or
- (3)
For each with and or
Proof. (1)
: Assume that (1) holds, and let
with
such that
and
Then,
Thus, So, ℶ and ℸ are *—graph-separated subgraphs. Since , or by (1).
(2) and Clear. □
Corollary 16. Assume that is a graph AS. Then, the next statements are equivalent:
- (1)
Ω is graph-connected;
- (2)
For each with and or
- (3)
For each with and or
Corollary 17. Assume that is a graph IAS. Then, the next statements are equivalent:
- (1)
Ω is —graph-ideal-connected;
- (2)
For each with and or
- (3)
For each with and or
Remark 8. Assume that is a graph IAS. If the graph Ω is a strongly disconnected graph, then it is graph-disconnected, *—graph-disconnected, and **—graph-disconnected graph. Similarly, if Ω is a strongly connected graph, then it is graph-connected, *—graph-connected, and **—graph-connected, as shown in the following example
Example 12. In this example, we apply Definitions 16 and 17 of connectedness to the original definition of connected and disconnected graphs. Assume that Ω is the graph where and The drawing of this graph Ω is given in Figure 15. The binary relation on the above graph Ω has the form , . This implies that , , . Also, Thus, Define a graph ideal on Ω as , , There exist two subgraphs and such that the following is the case:
Then, the graph Ω is disconnected, *—graph-disconnected, and **—graph-disconnected.
Theorem 8. Assume that is a graph IAS and is *—graph-connected. If is a *—graph separated set with then either or
Proof. Assume that
ℶ and
are *—graph-separated sets with
Then, we have
On the other hand, we obtain
Thus, and are *—graph-separated sets with But is *—graph-connected, which implies that or □
Corollary 18. Assume that is a graph IAS and is connected. If is a separated subgraph with then either or
Corollary 19. Assume that is a graph IAS and is —graph ideal connected. If is a —graph-ideal-separated set with then either or
Theorem 9. Assume that is a *—graph continuous function. Then, is a connected subgraph if ℶ is *—graph-connected in Ω.
Proof. Assume that
is *—graph-connected in
. Assume that
is disconnected. Then, there exist two separated subgraphs
with
i.e.,
Since
f is *—graph-continuous,
Thus, we have the following:
So, and are *—graph-separated subgraphs in , i.e., Hence, ℶ is *—graph-disconnected, which contradicts the statement that ℶ is *—graph-connected. Therefore, is a connected subgraph. □
Corollary 20. Assume that is a —graph continuous function. Then, is a connected subgraph if ℶ is —graph-connected in Ω.