Next Article in Journal
Journalism Model Based on Blockchain with Sharing Space
Previous Article in Journal
A Multi-Criteria Group Decision Making Model for Green Supplier Selection under the Ordered Weighted Hesitant Fuzzy Environment
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Fixed Point Results on Rectangular Metric-Like Spaces Endowed with a Graph

1
Department of Natural Sciences, Community College Al-Riyadh, King Saud University, Riyadh 4545, Saudi Arabia
2
Department of Industrial Ingeneering, College of Engineering, King Saud University, Riyadh 4545, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(1), 18; https://doi.org/10.3390/sym11010018
Submission received: 27 November 2018 / Revised: 19 December 2018 / Accepted: 20 December 2018 / Published: 26 December 2018

Abstract

:
The objective of this paper is to establish the existence and uniqueness of fixed points on rectangular metric-like spaces endowed with a graph. We introduce the notion of some generalized G-contractions principle. The usefulness of the considered metric space in real work is highlighted. The obtained results generalize some notes in the literature. Some examples are presented to support the main results.

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 ( E , d ) 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 0 < α < 1 . Therefore, T : E E 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 T u = u 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 G r -Kannan contraction, G-graphic contraction and ( G ϕ ) -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 u = v , 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 σ l : X × X R + be a mapping satisfying the following conditions
for all a , b , c X :
(L1)
σ l ( a , b ) = 0 a = b ,
(L2)
σ l ( a , b ) = σ l ( b , a ) ,
(L3)
σ l ( a , c ) σ l ( a , b ) + σ l ( b , c ) .
Then, σ l is called a metric-like and the pair ( X , σ l ) determine a metric-like space.
Note that metric-like spaces are more general than both metric and partial metric spaces since σ l ( a , a ) can be different from zero; in addition, σ l ( a , a ) may be bigger than σ l ( a , b ) . Thereby, every partial metric space is a metric-like space.
Example 1.
Let X = [ 0 , 1 ] and σ l ( a , b ) = 3 , i f   a = b , 2 , o t h e r w i s e .
It is easy to see that ( X , σ l ) is a metric-like space but not a partial metric space because σ l ( 0 , 0 ) σ l ( 0 , 1 ) .
Definition 2.
Ref. [16] Let there be a nonempty set X and σ r : X × X R + a mapping satisfying the following conditions for all x , y , z , t X :
(L1)
σ r ( x , y ) = 0 x = y ,
(L2)
σ r ( x , y ) = σ r ( y , x ) ,
(L3)
σ r ( x , y ) σ r ( x , z ) + σ r ( z , t ) + σ r ( t , y ) for all different z , t X \ { x , y } (Rectangular inequality).
Then, σ r is called a rectangular metric-like and the pair ( X , σ r ) determine a rectangular metric-like space.
Example 2.
Let X = { 1 , 2 , 3 , 4 , 5 } and define the mapping σ r : X × X [ 0 , ) by
σ r ( x , y ) = 2 , f o r   x y , 4 , i f   x = y = 1 , 0 , o t h e r w i s e .
It is easy to see that conditions L 1 and L 2 are satisfied. Let’s verify the rectangular inequality given by L 3 . Considering x , y X and for all distinct u , v X \ { x , y } , we have
σ r ( x , u ) + σ r ( u , v ) + σ r ( v , y ) = 2 + σ r ( u , v ) + 2 = 4 + σ r ( u , v ) σ r ( x , y ) x , y X .
Therefore, ( X , σ r ) is a rectangular metric-like space.
Definition 3.
Ref. [16] Let ( X , σ r ) be a rectangular metric-like space. Then,
1.
A sequence { x n } in ( X , σ r ) converges to x X if and only if lim n σ r ( x n , x ) = σ r ( x , x ) .
2.
A sequence { x n } in ( X , σ r ) is said to be σ r -Cauchy sequence if and only if the limit of σ r ( x n , x m ) exists and finite as n .
3.
( X , σ r ) is said to be σ r -complete if any σ r -Cauchy sequence { x n } in X converges to some point x such that
lim n σ r ( x n , x ) = σ r ( x , x ) = lim n , m σ r ( x n , x m ) .
Remark 1.
The convergence defined in the last definition is the convergence obtained in the sense of the topology generated by the open balls
B σ r ( x , δ ) = { y X s u c h   t h a t | σ r ( x , y ) σ r ( x , x ) < δ } , x X .
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 ( X , σ r ) and Δ is the diagonal of X × X . A graph G is defined by the set V = V ( G ) of vertices coinciding with X and the set E = E ( G ) of its edges such that Δ E ( G ) . Assume that the graph G has no parallel edges. Therefore, G can be identified with the pair ( V , E ) .
In addition, the graph G may be considered as a weighted graph by assigning to each edge the distance given by the σ r -metric between its vertices. We denote by G 1 the graph obtained from G by reversing the direction of edges in G. Then,
E ( G 1 ) = { ( x , y ) X 2 : ( y , x ) E ( G ) } and V ( G 1 ) = V ( G ) .
Let G ˜ denote the undirected graph built by ignoring the direction of all edges that is
E ( G ˜ ) = E ( G ) E ( G 1 ) .
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 ( k N { 0 } ) is a sequence ( x i ) i = 0 k of k + 1 distincts vertices such that x 0 = a , x k = b and ( x i , x i + 1 ) E ( G ) for i = 1 , 2 , , k .
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 G ˜ 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 G x 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, V ( G x ) = [ x ] G , where [ x ] G denotes the equivalence class of relation R ( x R y 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 ( X , σ r ) to be a rectangular metric-like space, and G is a simple graph of length bigger than 2 without parallel edges such that V ( G ) = X . Define F i x f = { u X / f u = u } .
Now, let us define the Kannan operator on metric space ( X , d ) .
Definition 7.
Ref. [17] Let ( X , d ) be a metric space. f : X X is called a Kannan operator if there exists a [ 0 , 1 2 ) such that:
d ( f x , f y ) a [ d ( x , f x ) + d ( y , f y ) ] x , y X .
Inspired by the Kannan operator, we introduce the concept of G r -contraction in rectangular metric-like spaces with a graph.
Definition 8.
Let ( X , σ r ) be a rectangular metric-like space endowed with a graph G. The mapping f : X X is said to be G r -Kannan contraction if
1.
x , y X , I f ( x , y ) E ( G ) ,   t h e n   ( f x , f y ) E ( G ) ,
2.
There exists a [ 0 , 1 2 ) such that
σ r ( f x , f y ) a ( σ r ( x , f x ) + σ r ( y , f y ) ) x , y E ( G ) .
Remark 2.
If f is a G r -Kannan mapping, then f is both a G r 1 -Kannan mapping and G ˜ r -Kannan mapping.
Lemma 1.
Let ( X , σ r ) be a rectangular metric-like space endowed with a graph G and f : X X be G r -Kannan mapping with constant a. If the graph G is weakly connected, then, given x , y X , there exists r ( x , y ) 0 such that
σ r ( f n x , f n y ) a σ r ( f n 1 x , f n x ) + ( a 1 a ) n r ( x , y ) + a σ r ( f n 1 y , f n y ) n N .
Proof. 
For every x , y X , we need to consider the following two cases.
If ( x , y ) G ˜ , then, by induction, ( f n x , f n y ) G ˜ ; therefore, Label (5) is true by taking r ( x , y ) = 0 for all n N .
If ( x , y ) G ˜ , then there is a path ( x i ) i = 0 N in G ˜ from x to y such that x 0 = x , , x N = y with ( x i 1 , x i ) E ( G ˜ ) for i = 1 , , N and ( x i , f x i ) E ( G ˜ ) for i = 1 , , N 1 .
Since f is a G ˜ r -Kannan contractive, then, by induction in Label (3), we get
( f n x i 1 , f n x i ) E ( G ˜ ) .
Now, by using the second property of G r -Kannan contraction given by (4), we obtain
σ r ( f 2 x i , f x i ) a [ σ r ( f x i , f 2 x i ) + σ r ( x i , f x i ) ] .
By induction, we obtain
σ r ( f n 1 x i , f n x i ) ( a 1 a ) n 1 σ r ( x i , f x i ) ,
knowing that the considered graph G is simple and from (6) we can conclude that f n 1 x i f n x i for all n N , 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: N = 2 p + 1 (i.e., N odd)
σ r ( f n x , f n y ) = σ r ( f n x 0 , f n x N ) σ r ( f n x 0 , f n x 1 ) + σ r ( f n x 1 , f n x 2 ) + σ r ( f n x 2 , f n x 3 ) + σ r ( f n x N 1 , f n x N ) a [ σ r ( f n 1 x 0 , f n x 0 ) + σ r ( f n 1 x 1 , f n x 1 ) + σ r ( f n 1 x 1 , f n x 1 ) + σ r ( f n 1 x 2 , f n x 2 ) + + σ r ( f n 1 x N 1 , f n x N 1 ) + σ r ( f n 1 x N , f n x N ) ] a [ σ r ( f n 1 x 0 , f n x 0 ) + 2 k = 1 N 1 σ r ( f n 1 x k , f n x k ) + σ r ( f n 1 x N , f n x N ) ] .
Using (7), we get
σ r ( f n x , f n y ) a σ r ( f n 1 x , f n x ) + ( a 1 a ) N r ( x , y ) + a σ r ( f n 1 y , f n y ) ,
where r ( x , y ) = 2 ( 1 a ) k = 1 N 1 σ r ( x k , f x k ) .
Case 2: N = 2 p (i.e., N even)
σ r ( f n x , f n y ) = σ r ( f n x 0 , f n x N ) σ r ( f n x 0 , f n x 1 ) + σ r ( f n x 1 , f n x 2 ) + + σ r ( f n x N 3 , f n x N 2 ) + σ r ( f n x N 2 , f n x N ) a [ σ r ( f n 1 x 0 , f n x 0 ) + σ r ( f n 1 x 1 , f n x 1 ) + σ r ( f n 1 x 1 , f n x 1 ) + σ r ( f n 1 x N 2 , f n x N 2 ) + σ r ( f n 1 x N 2 , f n x N ) + σ r ( f n 1 x N , f n x N ) ] a [ σ r ( f n 1 x 0 , f n x 0 ) + 2 ( a 1 a ) n 1 k = 1 N 2 σ r ( f n 1 x k , f n x k ) + σ r ( f n 1 x N , f n x N ) ] a σ r ( f n 1 x , f n x ) + ( a 1 a ) n r ( x , y ) + a σ r ( f n 1 y , f n y ) ,
where r ( x , y ) = 2 ( 1 a ) k = 1 N 2 σ r ( x k , f x k ) .
Finally, we obtain
σ r ( f n x , f n y ) a σ r ( f n 1 x , f n x ) + ( a 1 a ) n r ( x , y ) + a σ r ( f n 1 y , f n y ) ,
where
r ( x , y ) = 2 ( 1 a ) k = 1 N 1 σ r ( x k , f x k ) , if N = 2 p + 1 , 2 ( 1 a ) k = 1 N 2 σ r ( x k , f x k ) , if N = 2 p .
Theorem 1.
Let ( X , σ r ) be a σ r -complete rectangular metric-like space endowed with a graph G and f : X X be a continuous G r -Kannan contraction. We suppose that:
1.
G is weakly connected,
2.
for any ( x n ) n N , if x n x as n and ( x n , x n + 1 ) E ( G ) n N , then there is a subsequence ( x k n ) n N such that ( x k n , x ) E ( G ) n N .
Then, f has a unique fixed point and lim n f n x = x .
Proof. 
Let x X . By taking y = f x in lemma 1, we obtain
σ r ( f n x , f n + 1 x ) a σ r ( f n 1 x , f n x ) + ( a 1 a ) n r ( x , f x ) + a σ r ( f n y , f n + 1 x ) n N .
Therefore,
σ r ( f n x , f n + 1 x ) a 1 a σ r ( f n 1 x , f n x ) + a n ( 1 a ) n + 1 r ( x , f x ) .
Now, using (7), we get
σ r ( f n x , f n + 1 x ) ( a 1 a ) n σ r ( x , f x ) + n a n ( 1 a ) n + 1 r ( x , f x ) .
Let α = a 1 a ; then, α [ 0 , 1 ) . From (8), we have
k = 0 n σ r ( f k x , f k + 1 x ) k = 0 n α k σ r ( x , f x ) + 1 1 a k = 0 n r ( x , f x ) k α k = σ r ( x , f x ) 1 α n + 1 1 α + r ( x , f x ) 1 a k = 0 n k α k .
Since α < 1 , and the sequence k = 0 k α k is equivalent to o ( 1 n 2 ) that is convergent. Then,
k = 0 σ r ( f k x , f k + 1 x ) < .
Let’s prove that ( f n x ) n 0 is a σ r -Cauchy sequence; that is, lim n , p σ r ( f n x , f n + p x ) = 0 for all n , p N .
To use the rectangular inequality, we need to consider the following two cases:
Case 1: p = 2 s + 1
σ r ( f n x , f n + p x ) σ r ( f n x , f n + 1 x ) + σ r ( f n + 1 x , f n + 2 x ) + σ r ( f n + p 1 x , f n + p x ) k = n n + p 1 σ r ( f k x , f k + 1 x ) = k = 0 n + p 1 σ r ( f k x , f k + 1 x ) k = 0 n 1 σ r ( f k x , f k + 1 x ) .
Thus, from (9), we obtain
lim n σ r ( f n x , f n + p x ) = 0 for all odd p N .
Case 2: p = 2 s
σ r ( f n x , f n + p x ) σ r ( f n x , f n + 1 x ) + σ r ( f n + 1 x , f n + 2 x ) + + σ r ( f n + p 2 x , f n + p x ) k = n n + p 1 σ r ( f k x , f k + 1 x ) + σ r ( f n + p 2 x , f n + p x ) = k = 0 n + p 1 σ r ( f k x , f k + 1 x ) k = 0 n 1 σ r ( f k x , f k + 1 x ) + σ r ( f n + p 2 x , f n + p x ) .
Similarly, in case 1, we have k = 0 n + p 1 σ r ( f k x , f k + 1 x ) k = 0 n 1 σ r ( f k x , f k + 1 x ) 0 as n . Let’s prove that σ r ( f n + p 2 x , f n + p x ) 0 .
Using the second condition of the G r -Kannan contraction, we obtain
σ r ( f n + p 2 x , f n + p x ) a [ σ r ( f n + p 3 x , f n + p 2 x ) + σ r ( f n + p 1 x , f n + p x ) ] a k = 0 n + p σ r ( f k x , f k + 1 x ) 0   as   n .
Then,
σ r ( f n x , f n + p x ) 0   as   n   for   all   even   p N .
Therefore, from (11) and (13), we obtain that σ r ( f n x , f n + p x ) converges to 0 as n , p . Thus, ( f n x ) n 0 is a σ r -Cauchy sequence. From the completeness of ( X , σ ) , there exists some x X such that lim n f n x = x .
Now, let’s prove that x is a fixed point of f. Since the graph G is weakly connected, there is at least x 0 X such that ( x 0 , f x 0 ) E ( G ˜ ) ; then, ( f n x 0 , f n + 1 x 0 ) E ( G ˜ ) n N .
Using the second assertion of the theorem and given the fact that lim n f n x 0 = x , there is a subsequence ( f k n x 0 ) n 0 such that ( f k n x 0 , f x ) E ( G ) for all n N .
Now, let’s apply the rectangular inequality to σ r ( x , f x ) . Due to the Definition 2, we need to consider the following cases:
Case 1: If x f k n + 1 x 0 , x f k n + 2 x 0 , f x f k n + 2 x 0 and f x f k n + 1 x 0 ,
we obtain
σ r ( x , f x ) σ r ( x , f k n + 1 x 0 ) + σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) + σ r ( f k n + 2 x 0 , f x ) σ r ( x , f k n + 1 x 0 ) + σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) + a [ σ r ( f k n + 1 x 0 , f k n + 2 x ) + σ r ( x , f x ) ] .
Then,
σ r ( x , f x ) 1 1 a σ r ( x , f k n + 1 x 0 ) + 2 1 a σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) .
Using the fact that lim n f n x = x , we get
σ r ( x , f x ) 1 1 a σ r ( x , x ) + 2 1 a σ r ( x , x ) = 3 1 a σ r ( x , x ) .
Since in rectangular metric-like space σ r ( x , x ) is not necessarily zero, we need to prove it.
Let x X , by taking y = x in Lemma 1, we obtain:
σ r ( f n x , f n x ) a σ r ( f n 1 x , f n x ) + ( a 1 a ) n r ( x , x ) + a σ r ( f n 1 x , f n x ) .
Letting n and knowing that lim n f n x = x and ( a 1 a ) n 0 , we get
σ r ( x , x ) a σ r ( x , x ) + 0 r ( x , x ) + a σ r ( x , x ) .
Since r ( x , x ) is constant, then σ r ( x , x ) 2 a σ r ( x , x ) . Therefore,
σ r ( x , x ) = 0 .
Finally, from (15) and (16), we get σ r ( x , f x ) = 0 ; then, f x = x that is x is a fixed point of f.
Case 2: If x = f k n + 1 x 0 and then f x = f k n + 2 x 0 ,
from (4), we obtain
σ r ( x , f x ) = σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) a [ σ r ( f k n x 0 , f k n + 1 x 0 ) + σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) ] .
Then,
σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) a 1 a σ r ( f k n x 0 , f k n + 1 x 0 ) .
Letting n in (17) and knowing that lim n f n x 0 = x , we get
σ r ( x , f x ) σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) < σ r ( x , x ) .
Therefore, similarly to the precedent case, we obtain from (16) that f x = x .
Case 3: If x = f k n + 2 x 0 ,
it is similar to Case 2.
Case 4: If f x = f k n + 2 x 0 ,
since lim n f n x 0 = x , then there exists N N such that x = f N x 0 :
σ r ( x , f x ) = σ r ( f N x 0 , f k n + 2 x 0 ) a [ σ r ( f N 1 x 0 , f N x 0 ) + σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) ] < σ r ( f N 1 x 0 , f N x 0 ) + σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) .
Letting n in (20), we get
σ r ( f N 1 x 0 , f N x 0 ) + σ r ( f k n + 1 x 0 , f k n + 2 x 0 ) 2 σ r ( x , x )   a s   n .
Therefore, σ r ( x , f x ) < 2 σ r ( x , x ) and, from (16), we obtain f x = x .
Case 5: If f x f k n + 2 x 0 and x = f k n + 1 x 0 , this leads to a contradiction
Case 6: If f x f k n + 1 x 0 and x = f k n + 2 x 0 , it is the same reasoning in Case 5.
Let’s prove the uniqueness of x . Consider two fixed points x and y in X such that x = lim n f n x and y = lim n f n y . By letting n in (5) and using (16), we obtain that σ r ( x , y ) 0 ; therefore, x = y . □
Example 3.
Let X = [ 0 , 1 ] be endowed with the following rectangular metric-like
σ r ( x 1 , x 2 ) = 1 , i f   x 1 = x 2 , x 1 + x 2 2 , o t h e r w i s e .
Define the graph G by E ( G ) = { ( x 1 , x 2 ) [ 0 , 1 ] × [ 0 , 1 ] : x 1 x 2 } and let f self-map on [ 0 , 1 ] such that f x = x 2 .
It is easy to verify that ( X , σ r ) is a σ r -complete rectangular metric-like space, G is weakly connected and f is a G r -Kannan contraction with a = 2 5 . Then, by Theorem 1, f has a unique fixed point that is u = 0 .
Next, we prove the existence of a fixed point under another G-contraction called G-graphic contraction.
Definition 9.
Let ( X , σ r ) be a rectangular metric-like space endowed with a graph G. The mapping f : X X is a G-graphic contraction if the following conditions hold:
  • f preserve edge of G: ( x , y ) E ( G ) ( f x , f y ) E ( G ) x , y X ,
  • there exists α [ 0 , 1 ) such that
    σ r ( f x , f 2 x ) α σ r ( x , f x ) x X f ,
    σ r ( f x , f 3 x ) α σ r ( x , f 2 x ) x X f ,
where X f = { x X : ( x , f x ) E ( G ) o r ( f x , x ) E ( G ) } .
Definition 10.
A mapping f : X X is called orbitally G-continuous if for all a , b X and any sequence ( k n ) n N ,
( f k n a ) c o n v e r g e n t s   t o   b   a n d ( f k n a , f k n + 1 a ) E ( G ) n N   i m p l i e s   f ( f k n a ) f b .
Lemma 2.
Let ( X , σ r ) be a rectangular metric-like space endowed with a graph G. Let f : X X be a G-graphic contraction. If x X f , then there exists r ( x ) 0 , r 1 ( x ) 0 such that
σ r ( f n , f n + 1 x ) α n r ( x ) n N ,
σ r ( f n , f n + 2 x ) β n r 1 ( x ) n N .
Proof. 
Consider x X f , and let’s discuss the two cases ( x , f x ) E ( G ) and ( f x , x ) E ( G ) .
If ( x , f x ) E ( G ) , then, by induction, we obtain ( f n x , f n + 1 x ) E ( G ) . Thus, using (20), we get
σ r ( f n , f n + 1 x ) α n r ( x ) ,
where r ( x ) = σ r ( x , f x ) . If ( f x , x ) E ( G ) , we have ( f n + 1 x , f n x ) E ( G ) . By the same procedure above, we obtain the desired result.
Similarly, we prove the inequality (23) where r 1 ( x ) = σ r ( x , f 2 x ) . □
Theorem 2.
Let ( X , σ r ) be a σ r -complete rectangular metric-like space endowed with a graph G. Let f : X X be a G-graphic contraction and orbitally G-continuous.
Suppose that the triplet ( X , σ r , G ) satisfies the following condition ( P ) :
For any ( x n ) n N in X, if x n x and ( x n , x n + 1 ) E ( G ) (or respectively ( x n + 1 , x n ) E ( G ) ) n N , then there is a subsequence ( x k n ) n N with ( x k n , x ) E ( G ) (or respectively ( x , x k n ) E ( G ) ).
Then, the following statements hold:
1.
For any x X f , the restriction of f to [ x ] G ˜ has a fixed point.
2.
If G is weakly connected and X f , f has a fixed point.
Proof. 
  • Let x X f . Then, from lemma 2, there exists r ( x ) 0 such that σ r ( f n x , f n + 1 ) α n r ( x ) n N .
    Let n , m N m > n ; we claim that σ r ( f n x , f n + m x ) 0 as n , m . To prove the claim, we need to consider the following cases.
    Case 1: If there exists n N such that f n x = f n + 1 x .
    Then, f n + m x = f n + 1 x and σ r ( f n x , f n + m x ) = σ r ( f n x , f n + 1 x ) α n r ( x ) 0 as n .
    Case 2: n + m = 2 p + 1 ( n + m is odd) and for all n N f n x f n + 1 x .
    σ r ( f n x , f n + m x ) σ r ( f n x , f n + 1 x ) + σ r ( f n + 1 x , f n + 2 x ) + + σ r ( f 2 p 1 x , f 2 p x ) + σ r ( f 2 p 1 x , f 2 p + 1 x ) α n r ( x ) + α n + 1 r ( x ) + + α n + m 1 r ( x ) k = 1 m α n + k 1 r ( x ) .
    Case 3: n + m = 2 p ( n + m is even) and f n x f n + 1 x n N .
    σ r ( f n x , f n + m x ) σ r ( f n x , f n + 1 x ) + σ r ( f n + 1 x , f n + 2 x ) + + σ r ( f n + m 3 x , f n + m 2 x ) + σ r ( f n + m 2 x , f n + m x ) α n r ( x ) + α n + 1 r ( x ) + + α n + m 3 r ( x ) + σ r ( f n + m 2 x , f n + m x ) k = 1 m 2 α n + k 1 r ( x ) + σ r ( f n + m 2 x , f n + m x ) k = 1 m + 1 α n + k 1 r ( x ) + σ r ( f n + m 1 x , f n + m + 1 x ) k = 1 m + 1 α n + k 1 r ( x ) + σ r ( f n + m 1 x , f n + m x ) + σ r ( f n + m x , f n + m + 2 x ) + σ r ( f n + m + 2 x , f n + m + 1 x ) k = 1 m + 1 α n + k 1 r ( x ) + α n + m 1 r ( x ) + α n + m r 1 ( x ) + α n + m + 1 r ( x ) .
    Using the fact that 0 α < 1 and taking the limits in (24) and (25), we obtain
    σ r ( f n x , f n + m x ) 0 as n , m .
    Hence, ( f n x ) n N is a σ r -Cauchy sequence.
    From the σ r -completeness of the rectangular metric-like space, there exists u X such that f n x u , .
    Given that x X f , we get f n x X f for all n N .
    Now, assume that ( x , f x ) E ( G ) (which can be done also if ( f x , x ) E ( G ) ). By the property ( P ) , there exists a subsequence ( f k n x ) n N of ( f n x ) n N such that ( f k n x , u ) E ( G ) n N . Thereby, a path in G from x to u can be formed by the points: x , f x , , f k 1 x , u ; then, u [ x ] G ˜ .
    Since f is orbitally G-continuous, we obtain that f ( f k n x ) f u , which gives f u = u . Thus, u is a fixed point for f | [ x ] G ˜ .
  • Let x X f . Since G is weakly connected, we have X = [ x ] G ˜ and, using 1, we get that f has a fixed point.
Example 4.
Let X = [ 0 , 1 ] be endowed with the following rectangular metric-like
σ r ( a , b ) = 1 , i f   a = b , a + b 2 , o t h e r w i s e .
Consider E ( G ) = { ( 0 , 0 ) } { ( 0 , a ) , a 1 2 } { ( a , b ) , a , b ( 0 , 1 ) } , and the mapping
f : [ 0 , 1 ] [ 0 , 1 ] a s f o l l o w s : f x = x 2 , i f   x ( 0 , 1 ) , 0 , i f   x = 0 , 1 , i f   x = 1 .
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 f ( 0 ) = 0 and f ( 1 ) = 1 .
Inspired by the work of [15], we introduce the notion of ( G ϕ ) -contraction and we state a new fixed point theorem.
Definition 11.
Let ( X , σ r ) be a rectangular metric-like space endowed with a graph G. A map f is called to be a ( G ϕ ) -contraction if
1.
for all x , y X ,
( x , y ) E ( G )   i m p l i e s   ( f x , f y ) E ( G ) ,
2.
for all ( x , y ) E ( G ) ,
σ r ( f x , f y ) σ r ( x , y ) ϕ ( σ r ( x , y ) ) ,
where ϕ : [ 0 , ) [ 0 , ) is a nondecreasing continuous function such that ϕ ( t ) = 0 if and only if t = 0 .
Lemma 3.
Let ( X , σ r ) be a rectangular metric-like space and f : X X a ( G ϕ ) -contractive mapping. Then, for any x X and y [ x ] G ˜ , we have
lim n σ r ( f n x , f n y ) = lim n r ( f n x , f n y ) = 0 ,
where r ( x , y ) = i = 1 m σ r ( s i 1 , s i ) , { s i } i = 0 m is a path from x to y.
Proof. 
Consider x X and y [ x ] G ˜ . Then, there exists a path { s i } i = 0 k from x to y in the graph G. From (27) and (28), we get ( f n s i 1 , f n s i ) E ( G ) for all i = 1 , 2 , , k and n N and
σ r ( f n s i 1 , f n s i ) σ r ( f n 1 s i 1 , f n 1 s i ) ϕ ( σ r ( f n 1 s i 1 , f n 1 s i ) ) ,
σ r ( f n 1 s i 1 , f n 1 s i ) .                      
Thereby, { σ r ( f n s i 1 , f n s i ) } is a nonincreasing sequence.
Since σ r ( f n s i 1 , f n s i ) 0 , then the sequence is bounded by 0 and converges to some l. By taking the limit as n in (30), we get l l ϕ ( l ) l ϕ ( l ) = 0 ; then, using the property of the mapping ϕ , we get l = 0 . Therefore,
lim n σ r ( f n s i 1 , f n s i ) = 0 i = 1 , , k n N .
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.
Case 1: k = 2 p + 1
σ r ( f n x , f n y ) = σ r ( f n s 0 , f n s k ) = σ r ( f n s 0 , f n s 2 p + 1 ) σ r ( f n s 0 , f n s 1 ) + σ r ( f n s 1 , f n s 2 ) + σ r ( f n s 2 , f n s 2 p + 1 ) σ r ( f n s 0 , f n s 1 ) + σ r ( f n s 1 , f n s 2 ) + + σ r ( f n s 2 p , f n s 2 p + 1 ) = i = 1 k σ r ( f n s i 1 , f n s i ) = r ( f n x , f n y ) .
By taking the limit as n and using (32), we obtain
0 lim n σ r ( f n x , f n y ) lim n r ( f n x , f n y ) = 0 .
Then, lim n σ r ( f n x , f n y ) = lim n r ( f n x , f n y ) = 0 .
Case 2: k = 2 p
σ r ( f n x , f n y ) = σ r ( f n s 0 , f n s k ) = σ r ( f n s 0 , f n s 2 p ) σ r ( f n s 0 , f n s 1 ) + σ r ( f n s 1 , f n s 2 ) + σ r ( f n s 2 , f n s 2 p ) σ r ( f n s 0 , f n s 1 ) + σ r ( f n s 1 , f n s 2 ) + + σ r ( f n s 2 p 3 , f n s 2 p 2 ) + σ r ( f n s 2 p 2 , f n s 2 p ) = i = 1 2 p σ r ( f n s i 1 , f n s i ) σ r ( f n s 2 p 2 , f n s 2 p 1 ) σ r ( f n s 2 p 1 , f n s 2 p ) + σ r ( f n s 2 p 2 , f n s 2 p i = 1 2 p σ r ( f n s i 1 , f n s i ) + σ r ( f n s k 2 , f n s k ) . = r ( f n x , f n y ) + σ r ( f n s 2 p 2 , f n s y ) .
Similar to the result obtained in (32), we obtain that lim n σ r ( f n s i 2 , f n s i ) = 0 for all i = 1 , , k and n N . Then, lim n σ r ( f n s 2 p 2 , f n s y ) = lim n σ r ( f n s 2 p 2 , f n s 2 p ) = 0 . Therefore, from (33), we get
lim n σ r ( f n x , f n y ) = lim n r ( f n x , f n y ) = 0 .
Theorem 3.
Let ( X , σ r ) be a σ r -complete rectangular metric-like space endowed with a graph G. Let f : X X a ( G ϕ ) -contractive mapping. Suppose that the following conditions hold:
(i) 
for any sequence { f n x } in X such that f n x y X with ( f n + 1 , f n x ) E ( G ) , there exists a subsequence { f n k x } of { f n x } and n 0 N such that ( y , f n k x ) E ( G ) for all k n 0 .
(ii) 
There exists some x 0 X f : = { x X / ( x , f x ) E ( G ) } .
Then, f | [ x 0 ] G ˜ has a unique fixed point x [ x 0 ] G ˜ and f n y converges to x for all y [ x 0 ] G ˜ .
Proof. 
Let x 0 X f i.e ( f x 0 , x 0 ) E ( G ) then f x 0 [ x 0 ] G ˜ . Let’s prove that the sequence { f n x 0 } is σ r -Cauchy.
Using Lemma 3, we obtain lim n r ( f n + 1 x 0 , f n x 0 ) = 0 . Then, for ϵ > 0 , there exists n 0 N such that
r ( f n 0 + 1 x 0 , f n x 0 ) inf { ϵ 2 , ϕ ( σ r ( x j , f n x 0 ) ) } ,
where the vertex x j X is adjacent to f n x 0 with a direct edge. Since f x 0 [ x 0 ] G ˜ , for example, there exists a path between x 0 and f x 0 . By induction, we built a path between f n 0 x 0 and f n 0 + 1 x 0 in G ˜ . Subsequently, we get the existence of at least one vertex x j X adjacent to f n x 0 .
Let’s denote for any x X and any a R + the following balls:
B a ( x ) = { x [ x ] G ˜ : r ( x , x ) < a for at least one path in G ˜ from x to x } ,
B a ( x ) ¯ = { x [ x ] G ˜ : r ( x , x ) a for at least one path in G ˜ from x to x } .
Now, we claim that f ( B ϵ ( f n 0 x 0 ) ) ¯ B ϵ ( f n 0 x 0 ) ¯ , which leads us to get f n 0 + k x 0 [ f n 0 x 0 ] G ˜ .
Let y B ϵ ( f n 0 x 0 ) ¯ . Let { z i } i = 0 k be a path between z and f n 0 x 0 such that z 0 = y and z k = f n 0 x 0 . Then, { f z i } i = 0 k is a path between f y and f f n 0 x 0 . Therefore, f y [ f n 0 + 1 x 0 ] G ˜ . Since we proved above that there exists a path between f n 0 x 0 and f n 0 + 1 x 0 , then f y [ f n 0 x 0 ] G ˜ .
Thus, two cases arise:
Case 1: If 0 < r ( y , f n 0 x 0 ) ϵ 2
Since y [ f n 0 x 0 ] G ˜ , there exists a path { f y , , f n 0 + 1 x 0 , , f n 0 x 0 } between f y and f n 0 x 0 . Then,
r ( f y , f n 0 x 0 ) = r ( f y , f n 0 + 1 x 0 ) + r ( f n 0 + 1 x 0 , f n 0 x 0 ) = i = 1 k σ r ( f z i 1 , f z i ) + r ( f n 0 + 1 x 0 , f n 0 x 0 ) .
Using (28), we get
r ( f y , f n 0 x 0 ) i = 1 k σ r ( z i 1 , z i ) ϕ ( σ r ( z i 1 , z i ) ) + r ( f n 0 + 1 x 0 , f n 0 x 0 ) i = 1 k σ r ( z i 1 , z i ) + r ( f n 0 + 1 x 0 , f n 0 x 0 ) = r ( y , f n 0 x 0 ) + r ( f n 0 + 1 x 0 , f n 0 x 0 ) ϵ 2 + ϵ 2 = ϵ .
Case 2: If ϵ 2 < r ( y , f n 0 x 0 ) ϵ
Similarly, we have
r ( f y , f n 0 x 0 ) i = 1 k σ r ( z i 1 , z i ) ϕ ( σ r ( z i 1 , z i ) ) + r ( f n 0 + 1 x 0 , f n 0 x 0 ) i = 1 k σ r ( z i 1 , z i ) ϕ ( σ r ( z k 1 , z k ) ) + r ( f n 0 + 1 x 0 , f n 0 x 0 ) .
Using (34), we get r ( f n 0 + 1 x 0 , f n 0 x 0 ) ϕ ( σ r ( x j , f n 0 x 0 ) ) = ϕ ( σ r ( x j , f n 0 z k ) ) , where x j is a vertex adjacent to z k . Let x j = z k 1 . Then, we obtain r ( f n 0 + 1 x 0 , f n 0 x 0 ) ϕ ( σ r ( z k 1 , z k ) . Therefore,
r ( f y , f n 0 x 0 ) i = 1 k σ r ( z i 1 , z i ) ϕ ( σ r ( z k 1 , z k ) ) + ϕ ( σ r ( z k 1 , z k ) ) r ( y , f n 0 x 0 ) ϵ .
Thus, we proved that, for y B ϵ ( f n 0 x 0 ) ¯ , r ( f y , f n 0 x 0 ) ϵ i.e., f y B ϵ ( f n 0 x 0 ) ¯ , which implies that f ( B ϵ ( f n 0 x 0 ) ) ¯ B ϵ ( f n 0 x 0 ) ¯ ; thereafter, the claim was proved.
Since f n 0 + 1 x 0 B ϵ ( f n 0 x 0 ) ¯ , then f n 0 + 2 x 0 = f n 0 + 1 x 0 B ϵ ( f n 0 x 0 ) ¯ . By repeating this procedure for k = 1 , 2 , and knowing that f n 0 + k x 0 [ f n 0 x 0 ] G ˜ , it follows that f n x 0 B ϵ ( f n 0 x 0 ) ¯ for all n n 0 . Thus,
σ r ( f n x 0 , f n 0 x 0 ) r ( f n x 0 , f n 0 x 0 ) ϵ ,
which gives us that f n x 0 B ϵ ( f n 0 x 0 ) ¯ n n 0 . Finally, { f n x 0 } is a σ r -Cauchy sequence in X. Since X is σ r -complete, there exists l X such that f n x 0 l , n .
From condition i, there exists a subsequence { f n k x 0 } of { f n x 0 } and n 0 N such that ( l , { f n k x 0 } ) E ( G ) k N and k n 0 .
Using (28), we get
σ r ( f l , f n k + 1 x 0 ) σ r ( l , f n k x 0 ) + ϕ ( σ r ( l , f n k x 0 ) )
           = σ r ( l , f f n k 1 x 0 ) + ϕ ( σ r ( l , f f n k 1 x 0 ) ) .
Since f n k x 0 l as n for all n N , then we obtain lim f n k 1 x 0 = lim f n k + 1 x 0 = 0 Letting k in (38), we get
σ r ( f l , l ) σ r ( l , f l ) + ϕ ( σ r ( l , f l ) ) .
Thus, ϕ ( σ r ( l , f l ) ) = 0 and, from the property of ϕ , we have σ r ( l , f l ) = 0 . Then, f l = l ; that is, l is a fixed point of f.
Let’s prove that f n y l , as n . We consider the path { x 0 , f x 0 , , f n 1 x 0 , , f n 0 x 0 , l } between x 0 and l in G ˜ . Then, l [ x 0 ] G ˜ . Let y [ x 0 ] G ˜ arbitrary. Then, from Lemma 3, we obtain
lim n σ r ( f n y , f n x 0 ) = 0 lim n f n y = l .
Now, suppose that f has two fixed points u and v. Then, from Lemma 3, σ r ( u , v ) = σ r ( f n u , f n v ) 0 as n . Hence, u = v and we get the uniqueness of the fixed point. □
Example 5.
Consider X = [ 0 , ) and the rectangular metric-like σ r ( x , y ) = max { x , y } . Then, it is easy to verify that ( X , σ ) is a complete rectangular metric-like space. Let us define the mapping f for each x X by f x = x 2 x + 1 and ϕ ( t ) = t t + 1 .
Let E ( G ) = { ( x , y ) [ 0 , ) × [ 0 , ) | x y } .
We may assume w.l.o.g that y x . Then, it is easy to prove that f is a ( G ϕ ) -contraction and satisfies the conditions of Theorem 3. Thus, f has a fixed point ( u = 0 ) .

4. Conclusions

In closing, the author would like to bring to the reader’s attention that the following question is still open.
Question 1.
Let ( X , σ r ) be a σ r -complete rectangular metric-like space endowed with a graph G and g : X X be a continuous mapping such that
1.
x , y X , I f ( x , y ) E ( G ) , t h e n   ( g x , g y ) E ( G ) ,
2.
There exists 0 a < 1 2 such that
σ r ( g x , g y ) a max { σ r ( x , g x ) + σ r ( y , g y ) , σ r ( x , y ) } x , y E ( G ) .
In addition, assume that:
1.
G is weakly connected.
2.
For any ( t n ) n N , if ( t n , t n + 1 ) E ( G ) n N and lim n t n = t ; then, there is a subsequence ( t k n ) n N with ( t k n , t ) E ( G ) n N .
Given all the above conditions, does g have a unique fixed point?
Note that, if the above conjecture is true, then it will have a variety of interesting applications.
Question 2.
Let ( X , σ r ) be a σ r -complete rectangular metric-like space endowed with a graph G and g : X X be a continuous mapping such that
1.
x , y X , I f ( x , y ) E ( G ) , t h e n   ( g x , g y ) E ( G ) ,
2.
There exists 0 a < 1 2 such that
σ r ( g x , g y ) a max { σ r ( x , y ) , σ r ( x , x ) + σ r ( y , y ) 2 } x , y E ( G ) .
In addition, assume that:
1.
G is weakly connected.
2.
For any ( t n ) n N , if ( t n , t n + 1 ) E ( G ) n N and lim n t n = t , then there is a subsequence ( t k n ) n N with ( t k n , t ) E ( G ) n N .
Given all the above conditions, does g have a unique fixed point?

Author Contributions

These authors contributed equally to this work.

Funding

Deanship of Scientific Research, King Saud University: RG-1438-079.

Acknowledgments

This research has been funded by the Deanship of Scientific Research at King Saud University through the Research Group Project No. RG-1438-079.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Espinola, R.; Kirk, W.A. Fixed point theorems in R-trees with applications to graph theory. Topol. Its Appl. 2006, 153, 1046–1055. [Google Scholar] [CrossRef]
  2. Jachymski, J. The contraction principle for mappings on a metric space with a graph. Proc. Am. Math. Soc. 2008, 136, 1359–1373. [Google Scholar] [CrossRef]
  3. Altun, I.; Acar, O. Fixed point theorems for weak contractions in the sense of Berinde on partial metric spaces. Topol. Its Appl. 2012, 159, 2642–2648. [Google Scholar] [CrossRef]
  4. Beg, I.; Butt, A.R.; Radojevic, S. The contraction principle for set valued mapings on a metric space with a graph. Comput. Math. Appl. 2010, 60, 1214–1219. [Google Scholar] [CrossRef]
  5. Berinde, V.; Pacurar, M. Fixed points and continuity of almost contractions. Fixed Point Theory 2008, 9, 23–34. [Google Scholar]
  6. Samreen, M.; Kamran, T.; Shahzad, N. Some Fixed Point Theorems in b-Metric Space Endowed with Graph. Abstr. Appl. Anal. 2013, 967132. [Google Scholar] [CrossRef]
  7. Tripak, O. Common fixed points of G-nonexpansive mappings on Banach spaces with a graph. Fixed Point Theory Appl. 2016, 2016, 87. [Google Scholar] [CrossRef]
  8. Abbas, M.; Ali, B.; Petrusel, G. Fixed points of set-valued contractions in partial metric spaces endowed with a graph. Carpathian J. Math. 2014, 30, 129–137. [Google Scholar]
  9. Samreen, M.; Kamran, T. Fixed Point Theorems for Weakly Contractive Mappings on a Metric Space Endowed with a Graph. Filomat 2014, 441–450. [Google Scholar] [CrossRef]
  10. Aleomraninejad, S.M.A.; Rezapour, S.; Shahzad, N. Fixed point results on subgraphs of directed graphs. Math. Sci. 2013, 7, 41. [Google Scholar] [CrossRef] [Green Version]
  11. Kamran, T.; Postolache, M.; Fahimuddin; Ali, M.U. Fixed point theorems on generalized metric space endowed with graph. J. Nonlinear Sci. Appl. 2016, 9, 4277–4285. [Google Scholar] [CrossRef] [Green Version]
  12. Bejenaru, A.; Pitea, A. Fixed point and best proximity point theorems on partial metric spaces. J. Math. Anal. 2016, 7, 25–44. [Google Scholar]
  13. Shatanawi, W.; Postolache, M. Coincidence and fixed point results for generalized weak contractions in the sense of Berinde on partial metric spaces. Fixed Point Theory Appl. 2013, 2013, 54. [Google Scholar] [CrossRef] [Green Version]
  14. Hui, L.; Jun, Z.; Cheng, L.L. Application Examples of the Network Fixed Point Theory for Space-air-ground Integrated Communication Network. In Proceedings of the International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), Moscow, Russia, 18–20 October 2010. [Google Scholar]
  15. Amini, H. Metric like spaces, partial metric spaces and fixed points. Fixed Point Theory Appl. 2012, 2012, 204. [Google Scholar] [CrossRef]
  16. Mlaiki, N.; Abodayeh, K.; Aydi, H.; Abdeljawad, T.; Abuloha, M. Rectangular metric like type spaces and related fixed points. J. Math. Volume 2018, 2018, 3581768. [Google Scholar] [CrossRef]
  17. Kannan, R. Some results on fixed points-II. Am. Math. Mon. 1969, 76, 405–408. [Google Scholar]

Share and Cite

MDPI and ACS Style

Souayah, N.; Mrad, M. Some Fixed Point Results on Rectangular Metric-Like Spaces Endowed with a Graph. Symmetry 2019, 11, 18. https://doi.org/10.3390/sym11010018

AMA Style

Souayah N, Mrad M. Some Fixed Point Results on Rectangular Metric-Like Spaces Endowed with a Graph. Symmetry. 2019; 11(1):18. https://doi.org/10.3390/sym11010018

Chicago/Turabian Style

Souayah, Nizar, and Mehdi Mrad. 2019. "Some Fixed Point Results on Rectangular Metric-Like Spaces Endowed with a Graph" Symmetry 11, no. 1: 18. https://doi.org/10.3390/sym11010018

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop