1. Introduction
Graph theory has been the focus of many researchers which are used in various areas. In fact, graph theoretical concept modeled and analyzed systems in different fields. Mathematicians are becoming aware of the significance of this theory and they combined it with other branches of mathematics. One of the last and important fields were a fixed point theory. In 2006, Espinola and Kirk introduced some results on combining fixed point theory and graph theory [
1]. In 2008, Jachymski [
2] provided an interesting approach in this direction. His work is considered as a reference in this domain. Starting from this approach, many researchers have discussed the existence and uniqueness of fixed points in different metric spaces with a graph and several contractions that are used in several types of spaces [
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13].
In addition, the fixed point theory on metric spaces endowed with graph represented a favorable theoretical background for the concept of the network nodes. Depending on its application, this concept modeled a large variety of functions in different fields such data communications, internet network nodes, telecommunications network nodes. In order to understand the relationship between the network nodes and the fixed point theory, we consider the case study theme from a communication network. In this field, a network node is a connection point that can receive, create store or send along distributed network routes. Each node can transmit or redistribute data to other network nodes according to a routing strategy. For example, in internet networks, host computers that are identified by an IP address are considered as a physical network node. In data communications, a network node can be data terminal equipment, routers or servers. Hence, by combining all kinds of physical networks, the node is a vector which allowed us to define a network vector space
E [
14]. This space can be treated as a set of nodes and links. The function of links is to spread data provided by those nodes. Therefore, there exists a characteristic correlation between any two different nodes that can be given by a certain correlation measure
d. In this respect, we notice that
is a metric space. Knowing the limited dimension of the space in a real network, we obtain the completeness; then,
E is a Banach space. As stated above, we have transmission of data between nodes. More precisely, the transmitted information from a network node
x belonging to
E to another network node
y can be obtained using an operator
T. This operator could be a routing algorithm or a mining algorithm [
14]. On the other hand, in real work and taking into account the increasing of the complexity of nodes correlation, we can conclude that the measure between two nodes obtained from mapping by the operator
T becomes relatively small. Thus, the network operator
T is the compression mapping on
E and the compression coefficient is
such that
. Therefore,
is a contraction mapping on
E and all the assumptions of Banach fixed point theorem are made. Then,
T has a fixed point
u satisfying
and relative to the network nodes;
u is the network path prediction target node.
According to what we mention, it is very interesting to investigate in fixed point theory on metric spaces with graphs and to prepare a theoretical framework for applications to real cases using different metrics and contractions that can model different phenomena.
Throughout this paper, we consider the complete rectangular metric-like spaces and we debate fixed point results for generalized G-contractive type mapping. We will introduce the notion of -Kannan contraction, G-graphic contraction and -contraction. Some examples are presented to illustrate the obtained results.
The notion of metric-like is original and very important in real work. Actually, if we consider two nodes u and v such that , the measure between them is not necessarily equal to zero, which is the case in several fields. In addition, the rectangular metric that is characterized by its rectangular inequality plays an important role mainly when the number of nodes increases. In fact, to transmit information from source node to a target node, we observe that the shortest path contains in general more than one node.
2. Preliminaries
First, we remind the reader of the concept of metric-like spaces as well as the rectangular metric-like spaces and the convergence and completeness in this space. We presented also some basic concepts of graph theory which will be needed in the sequel.
Definition 1. Ref. [15] Let a nonempty set X and be a mapping satisfying the following conditions for all :
- (L1)
,
- (L2)
,
- (L3)
.
Then, is called a metric-like and the pair determine a metric-like space.
Note that metric-like spaces are more general than both metric and partial metric spaces since can be different from zero; in addition, may be bigger than . Thereby, every partial metric space is a metric-like space.
Example 1. Let and
It is easy to see that is a metric-like space but not a partial metric space because .
Definition 2. Ref. [16] Let there be a nonempty set X and a mapping satisfying the following conditions for all : - (L1)
,
- (L2)
,
- (L3)
for all different (Rectangular inequality).
Then, is called a rectangular metric-like and the pair determine a rectangular metric-like space.
Example 2. Let and define the mapping by It is easy to see that conditions and are satisfied. Let’s verify the rectangular inequality given by . Considering and for all distinct , we have Therefore, is a rectangular metric-like space.
Definition 3. Ref. [16] Let be a rectangular metric-like space. Then, - 1.
A sequence in converges to if and only if .
- 2.
A sequence in is said to be -Cauchy sequence if and only if the limit of exists and finite as .
- 3.
is said to be -complete if any -Cauchy sequence in X converges to some point x such that
Remark 1. The convergence defined in the last definition is the convergence obtained in the sense of the topology generated by the open balls
For more details on the topology of rectangular metric-like spaces, we refer to [
16].
Next, we present a few basic concepts of graph theory.
According to Jachymski [
2], we consider a rectangular metric-like space
and
is the diagonal of
. A graph
G is defined by the set
of vertices coinciding with
X and the set
of its edges such that
. Assume that the graph
G has no parallel edges. Therefore,
G can be identified with the pair
.
In addition, the graph
G may be considered as a weighted graph by assigning to each edge the distance given by the
-metric between its vertices. We denote by
the graph obtained from
G by reversing the direction of edges in
G. Then,
Let
denote the undirected graph built by ignoring the direction of all edges that is
Definition 4. A subgraph is a graph that consists of a subset of a graph’s edges and associated vertices.
Definition 5. Consider two vertices a and b in a graph G. A path in G from a to b of length k () is a sequence of distincts vertices such that , and for .
Definition 6. 1. A graph G is called connected if there is a path between any two vertices of G and it is weakly connected if is connected.
2. A graph G is said to be simple if it has neither multiple edges nor loops.
Consider x a vertex in a graph G. The subgraph denoted by and constituted by all edges and vertices which are contained in some path in G beginning at x is called the component of G containing x. In this case, , where denotes the equivalence class of relation R ( if there is a path in G from x to y).
In order to apply the rectangular inequality later to the vertices of the graph, we need to consider a graph of length bigger than 2 which means that, between two vertices, we can find a path through at least two other vertices.
3. Main Results
In this section, we consider to be a rectangular metric-like space, and G is a simple graph of length bigger than 2 without parallel edges such that . Define .
Now, let us define the Kannan operator on metric space .
Definition 7. Ref. [17] Let be a metric space. is called a Kannan operator if there exists such that: Inspired by the Kannan operator, we introduce the concept of -contraction in rectangular metric-like spaces with a graph.
Definition 8. Let be a rectangular metric-like space endowed with a graph G. The mapping is said to be -Kannan contraction if
- 1.
- 2.
There exists such that
Remark 2. If f is a -Kannan mapping, then f is both a -Kannan mapping and -Kannan mapping.
Lemma 1. Let be a rectangular metric-like space endowed with a graph G and be -Kannan mapping with constant a. If the graph G is weakly connected, then, given , there exists such that Proof. For every , we need to consider the following two cases.
If
, then, by induction,
; therefore, Label (
5) is true by taking
for all
.
If , then there is a path in from x to y such that with for and for .
Since
f is a
-Kannan contractive, then, by induction in Label (
3), we get
Now, by using the second property of
-Kannan contraction given by (
4), we obtain
By induction, we obtain
knowing that the considered graph
G is simple and from (
6) we can conclude that
for all
, which allow us to use the rectangular inequality below.
Now, in order to use the rectangular inequality, we need to consider the cases N odd and N even:
Case 1: (i.e.,
N odd)
Using (
7), we get
where
.
Case 2: (i.e.,
N even)
where
.
Finally, we obtain
where
□
Theorem 1. Let be a -complete rectangular metric-like space endowed with a graph G and be a continuous -Kannan contraction. We suppose that:
- 1.
G is weakly connected,
- 2.
for any , if as and , then there is a subsequence such that .
Then, f has a unique fixed point and .
Proof. Let
. By taking
in lemma 1, we obtain
Let
; then,
. From (
8), we have
Since
, and the sequence
is equivalent to
that is convergent. Then,
Let’s prove that is a -Cauchy sequence; that is, for all .
To use the rectangular inequality, we need to consider the following two cases:
Thus, from (
9), we obtain
Similarly, in case 1, we have as . Let’s prove that .
Using the second condition of the
-Kannan contraction, we obtain
Therefore, from (
11) and (
13), we obtain that
converges to 0 as
. Thus,
is a
-Cauchy sequence. From the completeness of
, there exists some
such that
.
Now, let’s prove that is a fixed point of f. Since the graph G is weakly connected, there is at least such that ; then, .
Using the second assertion of the theorem and given the fact that , there is a subsequence such that for all .
Now, let’s apply the rectangular inequality to . Due to the Definition 2, we need to consider the following cases:
Case 1: If , , and ,
Using the fact that
, we get
Since in rectangular metric-like space is not necessarily zero, we need to prove it.
Let
, by taking
in Lemma 1, we obtain:
Letting
and knowing that
and
, we get
Since
is constant, then
. Therefore,
Finally, from (
15) and (
16), we get
; then,
that is
is a fixed point of
f.
Case 2: If and then ,
Letting
in (
17) and knowing that
, we get
Therefore, similarly to the precedent case, we obtain from (
16) that
.
Case 3: If ,
it is similar to Case 2.
Case 4: If ,
since
, then there exists
such that
:
Letting
in (
20), we get
Therefore,
and, from (
16), we obtain
.
Case 5: If and , this leads to a contradiction
Case 6: If and , it is the same reasoning in Case 5.
Let’s prove the uniqueness of
. Consider two fixed points
and
in
X such that
and
. By letting
in (
5) and using (
16), we obtain that
; therefore,
. □
Example 3. Let be endowed with the following rectangular metric-like Define the graph G by and let f self-map on such that .
It is easy to verify that is a -complete rectangular metric-like space, G is weakly connected and f is a -Kannan contraction with . Then, by Theorem 1, f has a unique fixed point that is .
Next, we prove the existence of a fixed point under another G-contraction called G-graphic contraction.
Definition 9. Let be a rectangular metric-like space endowed with a graph G. The mapping is a G-graphic contraction if the following conditions hold:
f preserve edge of G: ⟹ ,
there exists such that
where .
Definition 10. A mapping is called orbitally G-continuous if for all and any sequence , Lemma 2. Let be a rectangular metric-like space endowed with a graph G. Let be a G-graphic contraction. If , then there exists , such that Proof. Consider , and let’s discuss the two cases and .
If
, then, by induction, we obtain
. Thus, using (
20), we get
where
. If
, we have
. By the same procedure above, we obtain the desired result.
Similarly, we prove the inequality (
23) where
. □
Theorem 2. Let be a -complete rectangular metric-like space endowed with a graph G. Let be a G-graphic contraction and orbitally G-continuous.
Suppose that the triplet satisfies the following condition :
For any in X, if and (or respectively ) , then there is a subsequence with (or respectively ).
Then, the following statements hold:
- 1.
For any , the restriction of f to has a fixed point.
- 2.
If G is weakly connected and, f has a fixed point.
Proof. Let . Then, from lemma 2, there exists such that .
Let ; we claim that as . To prove the claim, we need to consider the following cases.
Case 1: If there exists such that .
Then, and as .
Case 2: (
is odd) and for all
.
Case 3: (
is even) and
.
Using the fact that
and taking the limits in (
24) and (
25), we obtain
Hence, is a -Cauchy sequence.
From the -completeness of the rectangular metric-like space, there exists such that , .
Given that , we get for all .
Now, assume that (which can be done also if ). By the property , there exists a subsequence of such that . Thereby, a path in G from x to u can be formed by the points: ; then, .
Since f is orbitally G-continuous, we obtain that , which gives . Thus, u is a fixed point for .
Let . Since G is weakly connected, we have and, using 1, we get that f has a fixed point.
□
Example 4. Let be endowed with the following rectangular metric-like Consider , and the mapping Then, G is weakly connected and f is a G-graphic contraction. Indeed, f preserves edges of G and satisfies (20). In addition to this, f is orbitally G-continuous. Thereby, all conditions of theorem 2 are satisfied; then, the mapping f has two fixed points that is and . Inspired by the work of [
15], we introduce the notion of
-contraction and we state a new fixed point theorem.
Definition 11. Let be a rectangular metric-like space endowed with a graph G. A map f is called to be a -contraction if
- 1.
- 2.
for all
where is a nondecreasing continuous function such that if and only if .
Lemma 3. Let be a rectangular metric-like space and a -contractive mapping. Then, for any and , we havewhere , is a path from x to y. Proof. Consider
and
. Then, there exists a path
from
x to
y in the graph
G. From (
27) and (
28), we get
for all
and
and
Thereby, is a nonincreasing sequence.
Since
, then the sequence is bounded by 0 and converges to some
l. By taking the limit as
in (
30), we get
⟹
; then, using the property of the mapping
, we get
. Therefore,
Now, we use the rectangular inequality; for that, we need to distinguish the two cases k odd and k even where k is the length of the path between x and y.
By taking the limit as
and using (
32), we obtain
Then, .
Similar to the result obtained in (
32), we obtain that
for all
and
. Then,
. Therefore, from (
33), we get
□
Theorem 3. Let be a -complete rectangular metric-like space endowed with a graph G. Let a -contractive mapping. Suppose that the following conditions hold:
- (i)
for any sequence in X such that with , there exists a subsequence of and such that for all .
- (ii)
There exists some .
Then, has a unique fixed point and converges to for all .
Proof. Let i.e then . Let’s prove that the sequence is -Cauchy.
Using Lemma 3, we obtain
. Then, for
, there exists
such that
where the vertex
is adjacent to
with a direct edge. Since
, for example, there exists a path between
and
. By induction, we built a path between
and
in
. Subsequently, we get the existence of at least one vertex
adjacent to
.
Let’s denote for any
and any
the following balls:
Now, we claim that , which leads us to get .
Let . Let be a path between z and such that and . Then, is a path between and . Therefore, . Since we proved above that there exists a path between and , then .
Thus, two cases arise:
Case 1: If
Since
, there exists a path
between
and
. Then,
Case 2: If
Using (
34), we get
, where
is a vertex adjacent to
. Let
. Then, we obtain
. Therefore,
Thus, we proved that, for , i.e., , which implies that ; thereafter, the claim was proved.
Since
, then
. By repeating this procedure for
and knowing that
, it follows that
for all
. Thus,
which gives us that
. Finally,
is a
-Cauchy sequence in
X. Since
X is
-complete, there exists
such that
,
.
From condition i, there exists a subsequence of and such that and .
Since
as
for all
, then we obtain
Letting
in (
38), we get
Thus, and, from the property of , we have . Then, ; that is, l is a fixed point of f.
Let’s prove that
, as
. We consider the path
between
and
l in
. Then,
. Let
arbitrary. Then, from Lemma 3, we obtain
Now, suppose that f has two fixed points u and v. Then, from Lemma 3, as . Hence, and we get the uniqueness of the fixed point. □
Example 5. Consider and the rectangular metric-like . Then, it is easy to verify that is a complete rectangular metric-like space. Let us define the mapping f for each by and .
Let .
We may assume w.l.o.g that . Then, it is easy to prove that f is a -contraction and satisfies the conditions of Theorem 3. Thus, f has a fixed point .