Topologies on the Edges Set of Directed Graphs
Transcript of Topologies on the Edges Set of Directed Graphs
International Journal of Mathematical Analysis
Vol. 12, 2018, no. 2, 71 - 84
HIKARI Ltd, www.m-hikari.com
https://doi.org/10.12988/ijma.2018.814
Topologies on the Edges Set of
Directed Graphs
Khalid Abdulkalek Abdu1, 2 and Adem Kilicman1
1Department of Mathematics, University Putra Malaysia (UPM)
43400 Serdang, Selangor, Malaysia
2Department of Accounting, Al-Iraqia University, Adhmia, Baghdad, Iraq
Copyright Β© 2018 Khalid Abdulkalek Abdu and Adem Kilicman. This article is distributed
under the Creative Commons Attribution License, which permits unrestricted use, distribution, and
reproduction in any medium, provided the original work is properly cited.
Abstract
The aim of this article is to introduce a new approach of applying the topology on
digraphs by associate two topologies with the set of edges of any directed graph,
called compatible and incompatible edges topologies. Some properties of these
topologies were investigated. In particular, the properties of connectivity and
density are studied. Giving fundamental step toward studying some properties of
directed graphs by their corresponding topology, which is introduced in this
article, is our motivation.
Mathematics Subject Classification: 05C20, 54A05
Keywords: Directed graph, Topology, Edge induced subgraph
1. Introduction
One of the most important structures in discrete mathematics is graph theory. It is
a prominent mathematical tool in many subjects [4]. Their importance can be
attributed to two reasons. First, graphs are mathematically elegant from theoretical
viewpoint. Even though graphs are simple relational combinations, they can
represent topological spaces, combinatorial objects and many other mathematical
combinations. Many concepts will be very useful from practical perspective when
they abstractly represented by graphs and this represents the second reason for
importance of graphs [5]. Topology is an interesting and important field of mathe-
72 Khalid Abdulkalek Abdu and Adem Kilicman
matics. It is a powerful tool leading to such beneficial concepts as connectivity,
continuity, and homotopy. Its influence in most other branches of mathematics is
evident [6].
Topologizing discrete structures is a problem that many publications concerned
with it. One of these discrete structures is graph theory. In 1967, J. W. Evans et al.
[8] shows that there is a one-to-one correspondence between the labeled transitive
directed graphs with π points and the labeled topologies on π points as follows:
The family π΅ = {π¬(π£): π£ β π} forms a base for a topology on the set π of nodes
of a transitive directed graph π· = (π, πΈ), where π¬(π£) = {π£} βͺ {π’ β π: (π’, π£) βπΈ(π·)}. Conversely the transitive digraph corresponding to any topology π― on a
finite set π is achieved by drawing a line from π£ to π’ if and only if π£ is in every
open set containing π’. In 1967, S. S. Anderson and G. Chartrand [1] investigate
the lattice-graph of the topologies of transitive directed graphs presented by J. W.
Evans et al. [8]. In 1968, T. N. Bhargava and T. J. Ahlborn [3] shows that each
directed graph π· = (π, πΈ) defines a unique topological apace (π, π―πΈ) where π―πΈ ={π: π β 2π , π open}; and the subset π is said to define an open set if for every
pair of points (π’, π£) with π£ in π and π’ not in π, (π’, π£) β πΈ. In 1972, R. N.
Lieberman [9] defines two topologies on the set π of nodes of every directed
graph π· = (π, πΈ), called the left E-topology and the right E-topology. The left
E-topology is the collection of all subsets π of π such that if π£ β π and (π’, π£) β πΈ
then π’ β π while the right E-topology is the collection of all subsets π of π such
that if π£ β π and (π£, π’) β πΈ then π’ β π. He illustrated that the left E-topology is
equivalent with the topology presented by T. N. Bhargava and T. J. Ahlborn [3].
In 1973, E. Sampathkumar and K. H. Kulkarni [12] generalized the results
provided by J. W. Evans et al. [8]. In 2010, C. Marijuan [10] has studied the
relation between directed graphs and finite topologies. He associated a topology π―
to each directed graph π·. The sets of vertices adjacent to π’ in π·, for all vertices π’,
forms a subbasis of closed sets for π―. Reciprocally, by means of βspecializationβ
relation between points in a topological space he associate a directed graph to a
topology.
All previous works of topologies on directed graphs were associated with the
vertex set while no one has tried to associate a topology with the set of edges of a
given digraph. This motivated us to study this topology and gave fundamental
step toward studying some properties of directed graphs by their corresponding
topology. In addition, in some applications of the weighted digraph the edges
represent affinity, distance, bandwidth, or connection costs depending on the
application considered. Therefore, topologies associated with the set of edges of
digraphs might be used to deal with some weighted digraph problems. Indeed, that
what has been applied by Shokry [13]. He discussed a new method to generate
topology on graphs built on the choice of the distance between two vertices. He
indicated that this method can be applied in the graph of airline connections to
determine the distance between two vertices that gives the least number of flights
required to travel between two cities.
Topologies on the edges set of directed graphs 73
In this paper, we define two topologies on the set of edges of every directed
graph, called compatible and incompatible edges topologies. Properties of
compatible and incompatible edges topologies and the relation between these
topologies and their corresponding graphs are presented. In section 2 some
definitions of topology and graph theory is shown. Definitions of compatible and
incompatible edges topologies on the set of edges of directed graphs are
introduced. Section 3 is dedicated to some introductory results of compatible and
incompatible edges topologies. More properties are presented in section 4. The
subject of section 5 is the connectivity of compatible and incompatible edges
topologies. Eventually the last section of the article is devoted to the dense subsets
of compatible and incompatible edges topologies.
2. Preliminaries
In this part we review some basic notions of topology [11] and graph theory [5].
Furthermore, introduce the definitions of compatible and incompatible edges
topologies on directed graphs.
A topology π― on a set π΄ is a combination of subsets of π΄, called open, such that
the union of the members of any subset of π― is a member of π―, the intersection of
the members of any finite subset of π― is a member of π―, and both empty set and
π΄ are in π―. The ordered pair (π΄, π―) is called a topological space. The topology
π― = π«(π΄) on π΄ is called discrete topology while the topology π― = {π΄, β } on π΄ is
called trivial (or indiscrete) topology. A topology in which arbitrary intersection
of open set is open called Alexandroff space. The minimum closed set that
contains π is called the closure of π and denoted by οΏ½Μ οΏ½ such that π β π΄ and (π΄, π―)
is a topological space. Other topological notions are used such as basis and
subbasis, π―0, π―1, and π―2 spaces as can be seen in [11].
A directed graph π· consists of a non-empty set π(πΊ) of nodes (or vertices), a set
πΈ(πΊ) of arcs (or directed edges), and an incidence function ππ· that joins each arc
of π· with an ordered pair of (not necessary distinct) nodes of π·. Usually the
directed graph is denoted by π· = (π, πΈ, ππ·). If π is an arc such that
ππ·(π) = (π’, π£), then π’ is called the initial vertex of π and π£ is called the terminal
vertex of π also π is an arc from π’ to π£. If ππ·(π) = (π’, π’), then the arc π is called
a loop or self-loop. Two or more directed edges that have the same initial vertex
and the same terminal vertex are called parallel edges. Two distinct edges that are
incident with a common vertex are called adjacent edges. A directed graph which
has no loops or parallel edges is called simple directed graph. If there is exactly
one edge directed from every vertex to every other vertex in a simple directed
graph π·, then π· is called a complete symmetric digraph. A directed path is an
alternating sequence of distinct nodes and distinct arcs in which the sequence
begins and ends with nodes and its consecutive elements are incident such that
each edge is incident out of the vertex preceding it in the sequence and incident
into the vertex following it. A directed cycle is a directed path that begins and
ends at the same node. A directed graph that consists of a single directed cycle is
called a directed cycle graph.
74 Khalid Abdulkalek Abdu and Adem Kilicman
Now, we introduce the definitions of compatible and incompatible edges
topologies. These topologies generated by two subbases families contain sets of
cardinality less than or equal to two in order to provide all directed paths of length
two and above in the compatible edges topology while these sets provide the
relation between any two or more directed edges that have different directions in
the incompatible edges topology. These results pave the way to some applications
of directed graphs.
Definition 2.1. Let π· = (π, πΈ, ππ·) be any directed graph. The compatible edges
topology, denote π―πΆπΈ(π·), is a topology that associated with the set πΈ of edges of
π· and induced by the subbasis ππΆπΈ whose elements consist of the sets: π΅ β πΈ, |π΅| β€ 2 such that if π β π΅ and π is adjacent with π in the same direction, then π βπ΅, i.e. π β π΅ if π is adjacent with π and construct with π a path of length two. The
incompatible edges topology, denote π―πΌπΈ(π·), is a topology that associated with
the set πΈ of edges of π· and induced by the subbasis ππΌπΈ whose elements consist of
the sets: π΅ β πΈ, |π΅| β€ 2 such that if π β π΅ and π is adjacent with π in the
different direction, then π β π΅, i.e. π β π΅ if π is adjacent with π and not construct
a path with π.
Example 2.2. Consider the directed graph in figure 1 such that
π(π·) = {π£1, π£2, π£3, π£4}, πΈ(π·) = {π1, π2, π3, π4} and ππ·(π1) = (π£1, π£2),
ππ·(π2) = (π£2, π£3), ππ·(π3) = (π£3, π£4), ππ·(π4) = (π£1, π£2).
We have, the subbasis for π―πΆπΈ(π·) is ππΆπΈ = {{π1, π2}, {π4, π2}, {π2, π3}}.
By taking finitely intersection the basis obtained is {π2}, {π1, π2}, {π4, π2},
{π2, π3}, β .
Then by taking all unions the topology π―πΆπΈ(π·) can be written as:
π―πΆπΈ(π·) = {β , πΈ, {π2}, {π1, π2}, {π4, π2}, {π2, π3}, {π1, π2, π4}, {π1, π2, π3}, {π4, π2, π3}}.
Now, the subbasis for π―πΌπΈ(π·) is ππΌπΈ = {{π1, π4}, {π2}, {π3}}.
By taking finitely intersection the basis obtained is {π1, π4}, {π2}, {π3}, β .
Then by taking all unions the topology π―πΌπΈ(π·) can be written as:
π―πΌπΈ(π·) = {β , E, {π2}, {π3}, {π1, π4}, {π2, π3}, {π1, π2, π4}, {π1, π3, π4}}.
e1
e3 V3
V4
e2
Figure 1
e4
V2 V1
Topologies on the edges set of directed graphs 75
It is easy to see that π―πΆπΈ(π·) and π―πΌπΈ(π·) are non-similar but they produce the same
topology on the ground set E of a digraph π· = (π, πΈ, ππ·) when they are both
discrete topologies as in the directed cycle graph and the complete symmetric
digraph such that |π| β₯ 3.
3. Introductory Results
In this part we introduce some preliminary results and show that the compatible
and incompatible edges topologies are Alexandroff spaces.
Remark 3.1. Let π· = (π, πΈ, ππ·) be a directed graph. For any π β πΈ, the set of all
edges adjacent with π and have the same direction of π is denoted by π΄πΆ(π), i.e.
each element in π΄πΆ(π) constructs with π a path of length two. Likewise, the set of
all edges adjacent with π and have different direction of π is denoted by π΄πΌ(π), i.e.
each element in π΄πΌ(π) is adjacent with π and not construct a path with π.
Proposition 3.2. Let π―πΆπΈ(π·) and π―πΌπΈ(π·) be the compatible and incompatible
edges topologies respectively of the directed graph π· = (π, πΈ, ππ·). For any π βπΈ,
i. If |π΄πΆ(π)| β₯ 2 or π΄πΆ(π) = β , then {π} β π―πΆπΈ(π·).
ii. If |π΄πΌ(π)| β₯ 2 or π΄πΌ(π) = β , then {π} β π―πΌπΈ(π·).
Proof. (i) Suppose that |π΄πΆ(π)| β₯ 2. Then by remark 3.1, there exist at least two
edges π, π β π΄πΆ(π) such that each of them constructs with π a path of length two.
By definition of π―πΆπΈ(π·), there exist two open sets {π, π}, {π, π} β ππΆπΈ. This means
{π} is an element in the basis of π―πΆπΈ(π·). Hence {π} β π―πΆπΈ(π·). Similarly
if |π΄πΆ(π)| > 2. Now if π΄πΆ(π) = β , then there exists an open set π΅ β ππΆπΈ such that
π΅ = {π} by definition of π―πΆπΈ(π·). Thus {π} β π―πΆπΈ(π·). A similar argument holds
for (ii). β
It is important to bear in mind that the properties hold in compatible edges
topology are similarly hold in incompatible edges topology unless otherwise
indicated with taking into account the differences in symbols between them.
Therefore, the fundamental vehicle of our discussion will be the compatible edges
topology. The following corollary is a trivial result for proposition 3.2.
Corollary 3.3. Let π· = (π, πΈ, ππ·) be a directed graph. If |π΄πΆ(π)| β₯ 2 or
π΄πΆ(π) = β for all π β πΈ, then π―πΆπΈ(π·) is discrete topology.
Proposition 3.4. The compatible edges topology of the directed graph
π· = (π, πΈ, ππ·) is an Alexandroff space.
Proof. It is adequate to show that arbitrary intersection of elements of ππΆπΈ is open.
Since |π΅| β€ 2 for all π΅ β ππΆπΈ, then either β π΅π = β βπ=1 such that π β₯ 2 is open, or
β π΅π = π΅βπ=1 such that π΅π = π΅ for all π is open since π΅ β ππΆπΈ, or β π΅π = {π}β
π=1
76 Khalid Abdulkalek Abdu and Adem Kilicman
such that π β π΅π for all π β₯ 2. By proposition 3.2, {π} β π―πΆπΈ(π·) is open. β In any digraph π· = (π, πΈ, ππ·) since (πΈ, π―πΆπΈ(π·)) is Alexandroff space, for each
π β πΈ, the intersection of all open sets containing π is the smallest open set
containing π and denoted by ππΆ(π). Also the family ππΆπ· = {ππΆ(π)|π β πΈ} is the
minimal basis for the topological space (πΈ, π―πΆπΈ(π·)) (see [14]).
Proposition 3.5. In any directed graph π· = (π, πΈ, ππ·), ππΆ(π) = β π΅ππ΅πβππΆπΈ such
that π β π΅π for all π β₯ 1.
Proof. Since ππΆπΈ is the subbasis of π―πΆπΈ(π·) and ππΆ(π) is the intersection of all
open sets containing π, we have ππΆ(π) = β π΅ππ΅πβππΆπΈ such that π β₯ 1. This implies
that π β π΅π for all π. Therefore, π β β π΅π β ππΆ(π)π΅πβππΆπΈ for all π β₯ 1. From
definition of ππΆ(π) the proof is complete. β
Remark 3.6. Let π· = (π, πΈ, ππ·) be a directed graph. For any π β πΈ,
1. If |π΄πΆ(π)| β₯ 2, then β π΅ππ΅πβππΆπΈ= {π} such that π β π΅π for all π β₯ 2 because
|π΅π| β€ 2 for all π. By proposition 3.5, ππΆ(π) = {π}.
2. If π΄πΆ(π) = β , then there exists an open set π΅ β ππΆπΈ such that π΅ = {π}. By
proposition 3.5, ππΆ(π) = {π} since B is the only open set in ππΆπΈ that contain π.
3. If |π΄πΆ(π)| = 1, then there exists an open set π΅ = {π, π} β ππΆπΈ such that
π΄πΆ(π) = {π}. By proposition 3.5, ππΆ(π) = {π, π} since B is the only open set in
ππΆπΈ that contain π.
The following corollary is a trivial result for remark 3.6.
Corollary 3.7. For any π, π β πΈ in a directed graph π· = (π, πΈ, ππ·), we have π βππΆ(π) if and only if π΄πΆ(π) = {π}.
Corollary 3.8. Let π· = (π, πΈ, ππ·) be a directed graph. For any π β πΈ,
ππΆ(π) β π΅π and so ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ β π΅οΏ½Μ οΏ½ for all π such that π β π΅π for all π.
Proof. From proposition 3.5, ππΆ(π) = β π΅ππ΅πβππΆπΈ such that π β π΅π for all π β₯ 1.
Therefore, ππΆ(π) β π΅π for all π. Now to prove ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ β π΅οΏ½Μ οΏ½ for all π, let π β ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ
this implies ππΆ β© ππΆ(π) β β for all open set ππΆ containing π. Since ππΆ(π) β π΅π,
this implies ππΆ β© π΅π β β for all open set ππΆ containing π. Hence π β π΅οΏ½Μ οΏ½ and so
ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ β π΅οΏ½Μ οΏ½ for all π. β
Corollary 3.9. Given a directed graph π· = (π, πΈ, ππ·). For every π β πΈ,
{π}Μ Μ Μ Μ β ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ β π΅οΏ½Μ οΏ½ for all π such that π β π΅π for all π.
Proof. Let π β {π}Μ Μ Μ Μ , this implies ππΆ β© {e} β β for all open set ππΆ containing π.
Since {e} β ππΆ(π), then ππΆ β© ππΆ(π) β β for all open set ππΆ containing π. Hence
π β ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ and so {π}Μ Μ Μ Μ β ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ . Also by corollary 3.8, {π}Μ Μ Μ Μ β ππΆ(π)Μ Μ Μ Μ Μ Μ Μ Μ β π΅οΏ½Μ οΏ½ for all π.
Topologies on the edges set of directed graphs 77
Corollary 3.10. For any π, π β E in a directed graph π· = (π, πΈ, ππ·), we have π β{π}Μ Μ Μ Μ if and only if π΄πΆ(π) = {π}.
Proof. π β {π}Μ Μ Μ Μ β ππΆ β© {e} β β for all open set ππΆ containing π β π β ππΆ(π) β
π΄πΆ(π) = {π} by corollary 3.7. β
Remark 3.11. From [7] the Alexandroff topological space (π, π―) is π―1 if and only
if ππ₯ = {π₯}. It follows that (π, π―) is discrete. Therefore, the topological space
(πΈ, π―πΆπΈ(π·)) which is an Alexandroff space is π―1 if and only if it is discrete. Now,
from [2] we have, if (πΈ, π―πΆπΈ(π·)) is an Alexandroff space, then (πΈ, π―πΆπΈ(π·)) is π―0
space if and only if ππΆ(π) = ππΆ(π) implies π = π. This means ππΆ(π) β ππΆ(π)
for all distinct pair of edges π, π β πΈ. Then from corollary 3.7, the compatible
edges topology π―πΆπΈ(π·) is π―0 if and only if π΄πΆ(π) β {π} or π΄πΆ(π) β {π} for every
distinct pair of edges π, π β πΈ.
Proposition 3.12. Let π―πΆπΈ(π·) be the compatible edges topology of the directed
graph π· = (π, πΈ, ππ·). Then the two statements below are equivalent.
1. (πΈ, π―πΆπΈ(π·)) is π―2-space (Hausdorff space).
2. (πΈ, π―πΆπΈ(π·)) is π―1-space.
Proof. (1) β (2) is evident. Now suppose that (πΈ, π―πΆπΈ(π·)) is π―1-space. By remark
3.11, (πΈ, π―πΆπΈ(π·)) is π―1-space if and only if it is discrete. This means each
singleton is an open set in π―πΆπΈ(π·). Therefore, for each pair of distinct edges π, π βπΈ there exist two open sets {π}, {π} β π―πΆπΈ(π·) such that π β {π}, π β {π} and {π} β©{π} = β . Hence (πΈ, π―πΆπΈ(π·)) is Hausdorff space. β
4. Properties of Compatible and Incompatible Edges Topologies
Proposition 4.1. Let π―πΆπΈ(π·) be the compatible edges topology of the directed
graph π· = (π, πΈ, ππ·). Then we have the following:
i. If π = {π β πΈ|π΄πΆ(π) = β ππ |π΄πΆ(π)| β₯ 2}, then π β π―πΆπΈ(π·).
ii. If πΏ = {π β πΈ| |π΄πΆ(π)| = 1}, then L is closed in π―πΆπΈ(π·).
Proof. (i) Let π β π. Since π΄πΆ(π) = β or |π΄πΆ(π)| β₯ 2, then by remark 3.6,
ππΆ(π) = {π}. As a result π β ππΆ(π) β π and so π is an interior point of M. Hence
π β π―πΆπΈ(π·).
(ii) By assumption πΏ = β {π}πβπΏ and so οΏ½Μ οΏ½ = β {π}πβπΏΜ Μ Μ Μ Μ Μ Μ Μ Μ Μ =β {π}Μ Μ Μ Μ
πβπΏ by properties of
closure (see [11]). Let π β οΏ½Μ οΏ½, then π β {e}Μ Μ Μ Μ for some π β πΏ. By corollary 3.10,
π΄πΆ(π) = {π}. Therefore, |π΄πΆ(π)| = 1 and so π β πΏ. Hence οΏ½Μ οΏ½ β πΏ and the proof is
complete. β
Definition 4.2. Let π· = (π, πΈ, ππ·) be a directed graph. If all vertices and edges of
the directed graph H are in D and ππ» is the restriction of ππ· to πΈ(π»), then H is
called a subdigraph of D. A subset of the edges of a digraph D together with any
78 Khalid Abdulkalek Abdu and Adem Kilicman
vertices that are their endpoints is called edge-induced subdigraph of D (see [4]).
Let H be any edge-induced subdigraph of a directed graph π· = (π, πΈ, ππ·).
Regardless the directed graph π· or its topologies, the compatible edges topology
of π», denoted by π―πΆπΈ(π»), is a topology that associated with the set πΈπ» of edges of
H and induced by the subbasis ππΆπΈπ» whose elements consist of the sets: π΅ β πΈπ»,
|π΅| β€ 2 such that if π β π΅ and π is adjacent with π in the same direction, then π βπ΅, i.e. π β π΅ if π is adjacent with π and construct with π a path of length two.
Similarly, the incompatible edges topology can be defined for H.
Any subset of a topological space has a usual topology presented in the following
definition (see [11]).
Definition 4.3. Let π» = (ππ», πΈπ» , ππ») be an edge-induced subdigraph of the
directed graph π· = (π, πΈ, ππ·). The topology {πΈπ» β© ππΆ|ππΆ β π―πΆπΈ(π·)} is the
compatible relative edges topology of π» with respect to π· and denoted by π―πΆπΈ|π».
Likewise, the incompatible relative edges topology of π» with respect to π· is
defined by {πΈπ» β© ππΌ|ππΌ β π―πΌπΈ(π·)}.
The directed graph in figure 2 indicates that we can have π―πΆπΈ(π») β π―πΆπΈ|π». πΈπ» = {π1, π2}; {π2} β π―πΆπΈ|π» but {π2} β π―πΆπΈ(π»).
On the other hand, we always have
Proposition 4.4. π―πΆπΈ(π») β π―πΆπΈ|π».
Proof. Let ππΆ β π―πΆπΈ(π»), so that ππΆ β πΈπ». We must prove that ππΆ = ππΆβ² β© πΈπ»
for some ππΆβ² β π―πΆπΈ(π·). We put ππΆ = πΆ(ππΆ) β© πΈπ» such that
πΆ(ππΆ) =β© {πΉπΆ β π―πΆπΈ(π·)|ππΆ β πΉπΆ}. Since π―πΆπΈ(π·) is an Alexandroff space, then
πΆ(ππΆ) β π―πΆπΈ(π·). It is obvious that ππΆ β πΆ(ππΆ) β© πΈπ». Let π β πΆ(ππΆ) β© πΈπ», then
there is π β ππΆ such that π construct with π a path of length two in π». Therefore,
there is an open set π΅ β ππΆπΈπ» such that π΅ = {π, π} by definition of π―πΆπΈ(π»). Since
π΅ is the smallest open set contain {π, π}, then π΅ β ππΆ and so π β ππΆ. Hence
πΆ(ππΆ) β π―πΆπΈ(π·) β ππΆ and the proof is complete. β
Now, the interesting question is when the two topologies π―πΆπΈ(π») and π―πΆπΈ|π» on π»
are the same. The necessary condition will be given in the next proposition.
e1 e3
V3
V4
e2
Figure 2
V2
V1
Topologies on the edges set of directed graphs 79
Remark 4.5. Let π» be an edge-induced subdigraph of a directed graph
π· = (π, πΈ, ππ·). The edges of π» are called preserve adjacency with respect to
π―πΆπΈ(π·) if |π΄πΆ(π)| β₯ 2 in π·, then |π΄πΆ(π)| β₯ 2 in π» for any π β π». Likewise, The
edges of π» are called preserve adjacency with respect to π―πΌπΈ(π·) if |π΄πΌ(π)| β₯ 2
in π·, then |π΄πΌ(π)| β₯ 2 in π» for any π β π».
Proposition 4.6. Let π» be an edge-induced subdigraph of a directed graph
π· = (π, πΈ, ππ·). Then we have π―πΆπΈ(π») = π―πΆπΈ|π» if and only if the edges of π» are
preserve adjacency.
Proof. (β) Let π―πΆπΈ(π») = π―πΆπΈ|π». By contradiction, suppose that the edges of π»
are not preserve adjacency. This means there exists an edge π β π» such that |π΄πΆ(π)| β₯ 2 in π· and |π΄πΆ(π)| < 2 in π». By proposition 3.2, {π} β π―πΆπΈ(π·) and so
{π} β π―πΆπΈ|π» since πΈπ» β© {π} = {π}. Therefore, {π} β π―πΆπΈ|π» but {π} β π―πΆπΈ(π»)
which is a contradiction with the assumption since π―πΆπΈ(π») = π―πΆπΈ|π». Hence the
edges of π» are preserve adjacency.
(β) Suppose that the edges of π» are preserve adjacency. It is enough to prove that
π―πΆπΈ|π» β π―πΆπΈ(π») since by proposition 4.4 π―πΆπΈ(π») β π―πΆπΈ|π». By contradiction,
suppose that π―πΆπΈ|π» β π―πΆπΈ(π»). This means there exists an open set ππΆ β π―πΆπΈ|π» and
ππΆ β π―πΆπΈ(π»). Since πΈπ» is the original set for π―πΆπΈ|π» and π―πΆπΈ(π»), then ππΆ = {π} for
some π β π» such that |π΄πΆ(π)| β₯ 2 in π· and |π΄πΆ(π)| = 1 in π». Therefore, π is an
edge in π» and is not preserve adjacency which is a contradiction with the
assumption. Hence π―πΆπΈ|π» β π―πΆπΈ(π») and the proof is complete. β
Definition 4.7. Two directed graphs π·1 = (π1, πΈ1, ππ·1) and π·2 = (π2, πΈ2, ππ·2
) are
said to be isomorphic to each other, and written π·1 β π·2, if there exist bijections
πΉ: π1 β π2 and π€: πΈ1 β πΈ2 such that π is a directed edge from π’ to π£ in π·1 if and
only if π€(π) is a directed edge from πΉ(π’) to πΉ(π£) in π·2. The functions πΉ and π€
are called isomorphisms (see [5]).
Remark 4.8. It is clear that the topological spaces (πΈ1, π―πΆπΈ1(π·1)) and
(πΈ2, π―πΆπΈ2(π·2)) are homeomorphic, if the directed graphs π·1 = (π1, πΈ1, ππ·1
) and
π·2 = (π2, πΈ2, ππ·2) are isomorphic but in general the opposite is not true. For
example, in figure 3 the directed graphs π·1 and π·2 are not isomorphic, but their
compatible edges topologies are homeomorphic since both are discrete topologies.
e1 e3
V3
V4
e2
Figure 3
V2
V1
D1
u1
u2
u3
D2
f1 f2
f3
80 Khalid Abdulkalek Abdu and Adem Kilicman
Remark 4.9. It is well-known that a map π€: (πΈ1, π―1) β (πΈ2, π―2) between two
topological spaces is continuous if and only if π€(οΏ½Μ οΏ½) β π€(π)Μ Μ Μ Μ Μ Μ Μ for every subset π
of πΈ1 and closed if and only if π€(π)Μ Μ Μ Μ Μ Μ Μ β π€(οΏ½Μ οΏ½) for every subset π of πΈ1 (see [6]).
Proposition 4.10. Let π―πΆπΈ1(π·1) and π―πΆπΈ2
(π·2) be the compatible edges topologies
of the directed graphs π·1 = (π1, πΈ1, ππ·1) and π·2 = (π2, πΈ2, ππ·2
) respectively.
Suppose that π€: πΈ1 β πΈ2 is a function. Assume that π€ is a function between
(πΈ1, π―πΆπΈ1(π·1)) and (πΈ2, π―πΆπΈ2
(π·2)). Then we get the following:
i. The function π€ is continuous if and only if π΄πΆ(π) = {π} implies
π΄πΆ(π€(π)) = {π€(π)} for every π, π β πΈ1.
ii. If π€ is onto and π΄πΆ(π€(π)) = {π€(π)} implies π΄πΆ(π) = {π} for every π, π β πΈ1,
then π€ is closed. For the opposite, if π€ is closed and one-to-one, then
π΄πΆ(π€(π)) = {π€(π)} implies π΄πΆ(π) = {π} for every π, π β πΈ1.
Proof. (i) From corollary 3.10, we have π΄πΆ(π) = {π} if and only if π β {π}Μ Μ Μ Μ . Then
it is enough to prove that π€ is continuous if and only if π β {π}Μ Μ Μ Μ implies
π€(π) β {π€(π)}Μ Μ Μ Μ Μ Μ Μ Μ for every π, π β πΈ1. Suppose that π€ is continuous and π β {π}Μ Μ Μ Μ .
Then π€(π) β π€({π}Μ Μ Μ Μ ). Through continuity of π€, π€({π}Μ Μ Μ Μ ) β {π€(π)}Μ Μ Μ Μ Μ Μ Μ Μ and thus π€(π) β{π€(π)}Μ Μ Μ Μ Μ Μ Μ Μ . For the opposite, Let π be a subset of πΈ1 and π β οΏ½Μ οΏ½. It is obvious that
π = β {π}πβπ and thus οΏ½Μ οΏ½ = β {π}πβπΜ Μ Μ Μ Μ Μ Μ Μ Μ Μ Μ = β {π}Μ Μ Μ Μ
πβπ by properties of closure (see
[11]). For this reason there exists an element π β π such that π β {π}Μ Μ Μ Μ . By the
hypothesis π€(π) β {π€(π)}Μ Μ Μ Μ Μ Μ Μ Μ β π€(π)Μ Μ Μ Μ Μ Μ Μ . Thus π€(οΏ½Μ οΏ½) β π€(π)Μ Μ Μ Μ Μ Μ Μ and so π€ is continuous.
(ii) Suppose that π€ is onto and π be the right inverse of π€. For each π, π β πΈ2,
suppose that π΄πΆ(π) = {π}. Hence π΄πΆ(π€(π(π))) = {π€(π(π))}, because
π€ β π = πππΈ2. By the hypothesis π΄πΆ(π(π)) = {π(π)}. Then by (i) π is
continuous. Therefore, if π β πΈ1 and π is closed, we have π€(π) = πβ1(π)
which is closed, because π is continuous. For the opposite, if π€ is closed and
one-to-one. Thus π€β1 is continuous on π€(πΈ1). Therefore, by (i) for all π, π β πΈ1,
π΄πΆ(π€(π)) = {π€(π)} implies π΄πΆ(π€β1(π€(π))) = {π€β1(π€(π))} then π΄πΆ(π) = {π}.β
Corollary 4.11. By notation of proposition 4.10, π€ is homeomorphism if and only
if it is bijective and π΄πΆ(π) = {π} if and only if π΄πΆ(π€(π)) = {π€(π)} for every
π, π β πΈ1.
5. Connectivity
The necessary and sufficient conditions for connectivity of compatible and
incompatible edges topologies are investigated in this section. By corollary 3.3,
the compatible edges topology of every directed graph π· = (π, πΈ, ππ·) such that |π΄πΆ(π)| β₯ 2 or π΄πΆ(π) = β for all π β πΈ is disconnected since it is discrete
topology. Similarly, the incompatible edges topology of every directed graph π· =(π, πΈ, ππ·) such that |π΄πΌ(π)| β₯ 2 or π΄πΌ(π) = β for all π β πΈ is disconnected.
Topologies on the edges set of directed graphs 81
Definition 5.1. A topology π―πΆπΈ(π·) on a set πΈ is connected if πΈ it is not the union
πΈ = π1 βͺ π2 of two non-empty open disjoint subsets π1 and π2 (see [11]).
Proposition 5.2. The compatible edges topology of every disconnected digraph is
disconnected.
Proof. Let π· = (π, πΈ, ππ·) be a disconnected digraph. Suppose that {π·π , π β π½} is
the set of all components (connected subdigraphs) of π· such that
π·π = (ππ, πΈπ , ππ·π). For every component π·π , π β π½ we have, β π΅π = πΈ(π·π)π΅πβππΆπΈπ
and π΅π is an open set for all π΅π β ππΆπΈπ. As a result, πΈ(π·π) β π―πΆπΈ(π·). Since
[πΈ(π·π)]π in πΈ(π·) is the union of other components edges, thus
[πΈ(π·π)]π β π―πΆπΈ(π·). Then we have πΈ(π·) = πΈ(π·π) βͺ [πΈ(π·π)]π for every π β π½.
Hence πΈ(π·) is the union of two non-empty open disjoint subsets and so
(πΈ, π―πΆπΈ(π·)) is disconnected. β
The converse of proposition 5.2 is not true in general. For example, the directed
cycle graph of length three has a disconnected compatible edges topology but the
directed cycle is a connected digraph. Now, let π· = (π, πΈ, ππ·) be a connected
digraph such that π―πΆπΈ(π·) is not discrete, i.e. there exists at least one edge π β πΈ
such that |π΄πΆ(π)| = 1.
Proposition 5.3. Let π· = (π, πΈ, ππ·) be any connected digraph. If there exists an
edge π β πΈ such that π΄πΆ(π) = β , then π―πΆπΈ(π·) is disconnected.
Proof. Suppose that there exists an edge π β πΈ such that π΄πΆ(π) = β . By
proposition 3.2, {π} β π―πΆπΈ(π·). For any π β πΈ, there exists at least one open set
π΅ β ππΆπΈ such that π β π΅ by definition of π―πΆπΈ(π·). Therefore, πΈ β {π} β π―πΆπΈ(π·)
since it is the union of all open sets in ππΆπΈ with the exception of {π}. Then we
have πΈ(π·) = πΈ β {π} βͺ {π} and so πΈ(π·) is the union of two non-empty open
disjoint subsets. Hence π―πΆπΈ(π·) is disconnected. β
The opposite of proposition 5.3 is not true in general. For example, the directed
path graph of length four has a disconnected compatible edges topology but there
is no an edge π in the path such that π΄πΆ(π) = β .
The next proposition gives the sufficient condition for connectedness of the
compatible edges topology of any connected digraph.
Proposition 5.4. Let π· = (π, πΈ, ππ·) be any connected digraph. Then the
topological space (πΈ, π―πΆπΈ(π·)) is connected if and only if the intersection of any
two distinct sets in the subbasis ππΆπΈ of π―πΆπΈ(π·) is not an empty set.
Proof. The topological space (πΈ, π―πΆπΈ(π·)) is connected if and only if πΈ it is not the
union πΈ = π1 βͺ π2 of two non-empty open disjoint subsets π1 and π2 if and
only if by definition of π―πΆπΈ(π·), there are no open subsets in the subbasis of
82 Khalid Abdulkalek Abdu and Adem Kilicman
π―πΆπΈ(π·) such that (β π΅ππ΅πβππΆπΈ) βͺ (β π΅ππ΅πβππΆπΈ
) = πΈ and
(β π΅ππ΅πβππΆπΈ) β© (β π΅ππ΅πβππΆπΈ
) = β for some π, π if and only if π΅π β© π΅π β β for any
two distinct sets π΅π , π΅π β ππΆπΈ. β
6. Density in Compatible and Incompatible Edges Topologies
Some necessary conditions for dense subsets of compatible and incompatible
edges topologies associated to directed graphs are investigated in this part. The
only dense subset in (πΈ, π―πΆπΈ(π·)) of every directed graph π· = (π, πΈ, ππ·) such that |π΄πΆ(π)| β₯ 2 or π΄πΆ(π) = β for all π β πΈ is πΈ since π―πΆπΈ(π·) is discrete topology.
Likewise, πΈ is the only dense subset in (πΈ, π―πΌπΈ(π·)) of every directed graph π· =(π, πΈ, ππ·) if |π΄πΌ(π)| β₯ 2 or π΄πΌ(π) = β for all π β πΈ.
Remark 6.1. It is known that in (πΈ, π―πΆπΈ(π·)) the subset π β πΈ is dense in πΈ if and
only if the complement of π has empty interior (see [6]).
Proposition 6.2. Let π· = (π, πΈ, ππ·) be a directed graph and
π = {π β πΈ||π΄πΆ(π)| = 1} such that π β β . Then the set
π = {π β πΈ|π΄πΆ(π) = β ππ |π΄πΆ(π)| β₯ 2} is dense in (πΈ, π―πΆπΈ(π·)) if and only if
any distinct pair of edges π, β β π not construct a path in π·.
Proof. (β) Let π be a dense subset in (πΈ, π―πΆπΈ(π·)). By contradiction, suppose
that there exists a pair of edges π, β β π and construct a path in π·. By definition
of π―πΆπΈ(π·), there exists an open set π΅ β ππΆπΈ such that π΅ = {π, β}. This means
Int(π) β β which is a contradiction with the assumption since ππ = π and
Int(π) = β by remark 6.1.
(β) Suppose that any distinct pair of edges π, β β π not construct a path in π·. By
remark 6.1, it is enough to prove that the complement of π has empty interior.
For any π β π, π is an edge such that |π΄πΆ(π)| = 1. This means there exists only
one open set π΅ = {π, π} β ππΆπΈ such that π΄πΆ(π) = {π}. As a result, {π} β π―πΆπΈ(π·).
Therefore, Int(π) = β since {π} β π―πΆπΈ(π·) for any π β π and from assumption
any pair of edges π, β β π not constructs a path in π·. Hence π is dense in
(πΈ, π―πΆπΈ(π·)). Similarly, the set π = {π β πΈ|π΄πΌ(π) = β ππ |π΄πΌ(π)| β₯ 2} is dense in
(πΈ, π―πΌπΈ(π·)) if and only if any distinct pair of edges π, β β π not adjacent with
different directions such that β β π = {π β πΈ||π΄πΆ(π)| = 1}. β
Corollary 6.3. Let π· = (π, πΈ, ππ·) be a directed graph and
π = {π β πΈ||π΄πΆ(π)| = 1} such that π β β . Then a subset π΅ of πΈ is dense in
(πΈ, π―πΆπΈ(π·)) if and only if π β π΅ such that π = {π β πΈ|π΄πΆ(π) = β ππ |π΄πΆ(π)| β₯ 2} and any distinct pair of edges π, β β π not construct a path in π·.
Proof. (β) If π΅ is dense in (πΈ, π―πΆπΈ(π·)), then by remark 6.1, π΅π has empty
interior. By proposition 3.2, {π} β π―πΆπΈ(π·) for every π β π and so π β π―πΆπΈ(π·).
Topologies on the edges set of directed graphs 83
Hence π β π΅ and any distinct pair of edges π, β β π not construct a path in π·
because π΅π has empty interior.
(β) By proposition 6.2, οΏ½Μ οΏ½ = πΈ. From assumption, π β π΅ and any distinct pair of
edges π, β β π not construct a path in π·. Hence οΏ½Μ οΏ½ = πΈ and so π΅ is dense in
(πΈ, π―πΆπΈ(π·)). Likewise, if π· = (π, πΈ, ππ·) is a directed graph and
β β π = {π β πΈ||π΄πΆ(π)| = 1}, then a subset π΅ of πΈ is dense in (πΈ, π―πΌπΈ(π·)) if
and only if π β π΅ such that π = {π β πΈ|π΄πΌ(π) = β ππ |π΄πΌ(π)| β₯ 2} and any
distinct pair of edges π, β β π not adjacent with different directions. β
7. Concluding Remarks
A synthesis between graph theory and topology has been made. We introduce a
new investigation for topology on graphs by associating two topologies with the
set of edges of every directed graph, called compatible and incompatible edges
topologies. Some properties of these topologies were studied in details. We show
that these topologies are Alexandroff spaces. The new topologies can be used to
solve some problems on weighted digraphs that focusing on directed paths since
the compatible edges topology provides all directed paths in the digraph and this
is our suggestion for future work.
Acknowledgments. The authors would like to thank the referee for the valuable
comments.
References
[1] S. S. Anderson, G. Chartrand, The lattice-graph of the topology of a
transitive directed graph, Mathematica Scandinavica, 21 (1967), 105β109.
https://doi.org/10.7146/math.scand.a-10849
[2] F. G. Arenas, Alexandroff spaces, Acta Math. Univ. Comenian., 68 (1999),
17β25.
[3] T. N. Bhargava, T. J. Ahlborn, On topological spaces associated with
digraphs, Acta Mathematica Academiae Scientiarum Hungaricae, 19
(1968), 47β52. https://doi.org/10.1007/bf01894678
[4] J. A. Bondy, U. S. R. Murty, Graph Theory with Applications, Elsevier,
New York, 1976.
[5] C. Vasudev, Graph Theory with Applications, New Age International
Publishers, New Delhi, 2006.
[6] J. Dugundji, Topology, Allyn and Bacon, Inc., Boston, 1966.
84 Khalid Abdulkalek Abdu and Adem Kilicman
[7] A.E El-Attik, M.E. Abd El-Monsef and E.I. Lashin, On finite Toβ
topological spaces, Proceedings of the ninth Pragu Topological Symposium,
(Pragu 2001), Topological Atlas, Toronto, 2002, 75-90.
[8] J. W. Evans, F. Harary and M. S. Lynn, On the computer enumeration of
finite topologies, Comm. Assoc. Comp. Mach., 10 (1967), 295-298.
https://doi.org/10.1145/363282.363311
[9] R. N. Lieberman, Topologies on Directed Graphs, Technical Reports Server
TR-214, University of Maryland, 1972.
[10] C. Marijuan, Finite topology and digraphs, Proyecciones (Antofagasta), 29
(2010), 291β307. https://doi.org/10.4067/s0716-09172010000300008
[11] J. M. MΓΈller, General Topology, Matematisk Institut, Universitetsparken 5,
2007.
[12] E. Sampathkumar, K. H. Kulkarni, Transitive digraphs and topologies on a
set, J. Karnatak Univ. Sci., 18 (1973), 266β273.
[13] M. Shokry, Generating topology on graphs by operations on graphs, Applied
Mathematical Sciences, 9 (2015), 2843-2857.
https://doi.org/10.12988/ams.2015.5154
[14] T. Speer, A short study of Alexandroff space, Department of Mathematics,
New York University, July 2007.
Received: January 30, 2018; Published: February 22, 2018