## 2. Preliminaries

In this section, we present some useful preliminary definitions and results related to our study. First, we remind the reader of the definition of rectangular metric spaces along with the topology.

**Definition** **2.** [30] Let X be a nonempty set. If the function $d:{X}^{2}\u27f6[0,\infty )$ satisfies the following conditions for all $x,y,z\in X$: - (r
_{1}) $x=y$ if and only if $d(x,y)=0$;

- (r
_{2}) $d(x,y)=d(y,x)$;

- (r
_{3}) $d(x,y)\le d(x,u)+d(u,v)+d(v,y)$ for all different $u,v\in X\backslash \{x,y\}$,

then the pair $(X,d)$ is called a rectangular metric space.

**Definition** **3.** [30] Let $(X,d)$ be a rectangular metric space. Then, - 1.
a sequence $\left\{{x}_{n}\right\}$ in X converges to a point x if and only if $\underset{n\to \infty}{lim}d({x}_{n},x)=0$.

- 2.
a sequence $\left\{{x}_{n}\right\}$ in X is called Cauchy if $\underset{n,m\to \infty}{lim}d({x}_{n},{x}_{m})=0$.

- 3.
$(X,d)$ is said to be complete if every Cauchy sequence $\left\{{x}_{n}\right\}$ in X converges to a point $x\in X$.

- 4.
Let ${B}_{r}({x}_{0},\delta )=\{y\in X\text{}such\text{}that\text{}d({x}_{0},y)\delta \}$ be an open ball in $(X,d)$. A mapping $f:X\u27f6X$ is continuous at ${x}_{0}\in X$ if for each $\u03f5>0$, there exists $\delta >0$ so that $f\left({B}_{r}({x}_{0},\delta )\right)\subset {B}_{r}(f{x}_{0},\u03f5)$.

Now, we present the definition of a best proximity point in the rectangular metric spaces $(X,d)$.

**Definition** **4.** Let $A,B$ be nonempty subsets of $(X,d)$ and $f:A\u27f6B$ be a given mapping. We denote by $d(A,B)=inf\left\{d\right(a,b):a\in A,b\in B\}$. An element $u\in A$ is called a best proximity point for the mapping f if $d(u,fu)=d(A,B)$. We denote by ${A}_{0}$ and ${B}_{0}$ the following sets: The concept of

P-property was defined by Raj in Reference [

32].

**Definition** **5.** [32] Let $(A,B)$ be a pair of non-empty subsets of $(X,d)$ such that ${A}_{0}\ne \varnothing $. We say that the pair $(A,B)$ has the P-property if and only if for ${x}_{1},{x}_{2}\in {A}_{0}$ and ${y}_{1},{y}_{2}\in {B}_{0}$ $\left.\begin{array}{cc}d({x}_{1},{y}_{1})\hfill & =d(A,B)\hfill \\ d({x}_{2},{y}_{2})\hfill & =d(A,B)\hfill \end{array}\right\}\u27f9d({x}_{1},{x}_{2})=d({y}_{1},{y}_{2})$. Here, let us recall some preliminaries from graph theory. Let

X be a nonempty set and

$\Delta =\left\{\right(x,x)\in X\times X,x\in X\}$. A graph

G is a pair

$(V,E)$ where

$V=V\left(G\right)$ is a set of vertices coinciding with

X and

$E=E\left(G\right)$ the set of its edges such that

$\Delta \subset E\left(G\right)$. Furthermore, throughout this paper, we assume that the graph

G has no parallel edges, that is, we do not allow it to get two or more edges that are incident to the same two vertices. By reversing the direction of edges in

G, we get the graph denoted

${G}^{-1}$ where its set of edges and vertices are defined as follows:

Consider the graph

$\tilde{G}$ consisting of all vertices and edges of

G and

${G}^{-1}$, that is,

We denote by $\tilde{G}$ the undirected graph obtained by ignoring the direction of edges of G.

**Definition** **6.** [31] A subgraph is a graph which consists of a subset of a graph’s edges and associated vertices. **Definition** **7.** [31] Let x and y be two vertices in a graph G. A path in G from x to y of length n ($n\in \mathbb{N}\cup \left\{0\right\}$) is a sequence ${\left({x}_{i}\right)}_{i=0}^{n}$ of $n+1$ distinct vertices such that ${x}_{0}=x$, ${x}_{n}=y$ and $({x}_{i},{x}_{i+1})\in E\left(G\right)$ for $i=1,2,\dots ,n$. **Definition** **8.** [31] A graph G is said to be connected if there is a path between any two vertices of G and it is weakly connected if $\tilde{G}$ is connected. **Definition** **9.** [31] A path is called elementary if no vertices appear more than once in it. For more details see Figure 1 and Figure 2. Let $(X,d)$ be a rectangular metric space. The graph G may be converted to a weighted graph by assigning to each edge the distance given by the rectangular metric between its vertices. In order to later apply the rectangular inequality 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

First, let $(X,d)$ be a rectangular metric space and G be a directed graph without parallel edges such that $V\left(G\right)=X$.

**Definition** **10.** Let A and B be two nonempty subsets of $(X,d)$. A mapping $f:A\u27f6B$ is said to be a G- contraction mapping if for all $x,y\in A$, $x\ne y$ with $(x,y)\in E\left(G\right)$:

- (i)
$d(fx,fy)\le \alpha d(x,y)$, for some $\alpha \in [0,1)$,

- (ii)
$\left.\begin{array}{cc}d({x}_{1},fx)\hfill & =d(A,B)\hfill \\ d({y}_{1},fy)\hfill & =d(A,B)\hfill \end{array}\right\}\u27f9({x}_{1},{y}_{1})\in E\left(G\right),\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\forall {x}_{1},{y}_{1}\in A.$

Our first main result is as follows:

**Theorem** **1.** Let $(X,d)$ be a complete rectangular metric space, A and B be two nonempty closed subsets of $(X,d)$ such that $(A,B)$ has the P-property. Let $f:A\u27f6B$ be a continuous G-contractive mapping such that $f\left({A}_{0}\right)\subseteq {B}_{0}$ and ${A}_{0}\ne \varnothing $. Assume that d is continuous and the following condition $\left({C}_{1}\right)$ holds: there exist ${x}_{0}$ and ${x}_{1}$ in ${A}_{0}$ such that there is an elementary path in ${A}_{0}$ between them and $d({x}_{1},f{x}_{0})=d(A,B)$.

Then, there exists a sequence ${\left\{{x}_{n}\right\}}_{n\in \mathbb{N}}$ with $d({x}_{n+1},f{x}_{n})=d(A,B)$ for $n\in \mathbb{N}$. Moreover, if there exists a path ${\left({y}^{i}\right)}_{i=0}^{s}\subseteq {A}_{0}$ in G between any two elements x and y, then f has a unique best proximity point.

**Proof.** From the condition $\left({C}_{1}\right)$, there exist two points ${x}_{0}$ and ${x}_{1}$ in ${A}_{0}$ such that $d({x}_{1},f{x}_{0})=d(A,B)$ and a path ${\left({t}_{0}^{i}\right)}_{i=0}^{N}$ in G between them such that the sequence ${\left\{{t}_{0}^{i}\right\}}_{i=0}^{N}$ containing points of ${A}_{0}$. Consequently, ${t}_{0}^{0}={x}_{0}$, ${t}_{0}^{N}={x}_{1}$ and $({t}_{0}^{i},{t}_{0}^{i+1})\in E\left(G\right)$ $\forall 0\le i\le N$.

Given that ${t}_{0}^{1}\in {A}_{0}$, $f\left({A}_{0}\right)\subseteq {B}_{0}$ and from the definition of ${A}_{0}$, there exists ${t}_{1}^{1}\in {A}_{0}$ such that $d({t}_{1}^{1},f{t}_{0}^{1})=d(A,B)$. Similarly, for $i=2,\dots ,N$, there exists ${t}_{1}^{i}\in {A}_{0}$ such that $d({t}_{1}^{i},f{t}_{0}^{i})=d(A,B)$.

As

${\left({t}_{0}^{i}\right)}_{i=0}^{N}$ is a path in

G then

$({t}_{0}^{0},{t}_{0}^{1})=({x}_{0},{t}_{0}^{1})\in E\left(G\right)$. From the above, we have

$d({x}_{1},f{x}_{0})=d(A,B)$ and

$d({t}_{1}^{1},f{t}_{0}^{1})=d(A,B)$. Therefore, as

f is a

G-contraction, it follows that

$({x}_{1},{t}_{1}^{1})\in E\left(G\right)$. In a similar manner, it follows that

Let

${x}_{2}={t}_{1}^{N}$. Then,

${\left({t}_{1}^{i}\right)}_{i=0}^{N}$ is a path from

${x}_{1}={t}_{1}^{0}$ to

${x}_{2}={t}_{1}^{N}$. For each

$i=2,\dots ,N$, as

${t}_{1}^{i}\in {A}_{0}$ and

$f{t}_{1}^{i}\in f\left({A}_{0}\right)\subseteq {B}_{0}$, then by the definition of

${B}_{0}$, there exists

${t}_{2}^{i}\in {A}_{0}$ such that

$d({t}_{2}^{i},f{t}_{1}^{i})=d(A,B)$. In addition, we have

$d({x}_{2},f{x}_{1})=d(A,B)$. As above mentioned, we obtain

Let ${x}_{3}={t}_{2}^{N}$. Then, ${\left({t}_{2}^{i}\right)}_{i=0}^{N}$ is a path from ${t}_{2}^{0}={x}_{2}$ and ${t}_{2}^{N}={x}_{3}$.

Continuing in this process, for all

$n\in \mathbb{N}$, we generate a path

${\left({t}_{n}^{i}\right)}_{i=0}^{N}$ from

${x}_{n}={t}_{n}^{0}$ and

${x}_{n+1}={t}_{n}^{N}$. As a consequence, we build a sequence

${\left\{{x}_{n}\right\}}_{n\in \mathbb{N}}$ where

${x}_{n+1}\in {\left[{x}_{n}\right]}_{G}^{N}$ and

$d({x}_{n+1},f{x}_{n})=d(A,B)$ such that

From the

P-property of

$(A,B)$ and (

7), it follows for each

$n\in \mathbb{N}$,

Next, we claim that $d({x}_{n},{x}_{n+1})\le {\alpha}^{n}C$, where C is a constant. To prove the claim, we need to consider the following two cases where ${\left({t}_{n}^{i}\right)}_{i=0,\dots ,N}$ is a path from ${x}_{n}$ to ${x}_{n+1}$.

Note that for all $i=0,\dots ,N$, ${\left({t}_{n}^{i}\right)}_{i=0,\dots ,N}$ are different owing to the fact that the considered path $\left({t}_{n}^{i}\right)$ is elementary. Then, we can apply the triangular inequality $\left({r}_{3}\right)$.

**Case 1:**$N=2k+1$ (N is odd).

For any positive integer

n, we get

Knowing that

$({t}_{n-1}^{i-1},{t}_{n-1}^{i})\in E\left(G\right)$ for all

$n\in \mathbb{N},$ and

f is a

G-contraction, we obtain from (9)

By induction, it follows that for all

$n\in \mathbb{N}$
where

$C=\sum _{i=1}^{N}d({t}_{0}^{i-1},{t}_{0}^{i})$.

**Case 2:**$N=2k$ (

N is even).

By the same arguments used in Case 1, we deduce that

$\sum _{i=1}^{2k}d(f{t}_{n-1}^{i-1},f{t}_{n-1}^{i})\le {\alpha}^{n}\sum _{i=1}^{N}d({t}_{0}^{i-1},{t}_{0}^{i})$. On the other hand,

$d({t}_{n}^{2k-2},{t}_{n}^{2k})\le {\alpha}^{n}d({t}_{0}^{2k-2},{t}_{0}^{2k})$. Indeed, from (

7), we have

$d({t}_{n}^{2k-2},f{t}_{n-1}^{2k-2})=d(A,B)$ and

$d({t}_{n}^{2k},f{t}_{n-1}^{2k})=d(A,B)$ and using the P-property, we get

Then, we conclude that $d({x}_{n},{x}_{n+1})\le {\alpha}^{n}C$ where $C=\sum _{i=1}^{N}d({t}_{0}^{i-1},{t}_{0}^{i})+d({t}_{0}^{2k-2},{t}_{0}^{2k})$.

Let us prove that

$\left\{{x}_{n}\right\}$ is a Cauchy sequence. Let

$n,m\in \mathbb{N}$ such that

$m\ge n$. We suppose w.l.o.g that

m is odd (

$m=2k+1$) since the case

$m=2k$ is similar. Note that

${x}_{n}={t}_{0}^{n}$,

${x}_{n+1}={t}_{n}^{N}$ and

${t}_{0}^{n}\ne {t}_{n}^{N}$ for all

n since the path

${\left({t}_{n}^{i}\right)}_{i=0,\dots ,N}$ is elementary. Then, using the triangular inequality of the rectangular metric, we obtain

As $\alpha <1$, then $\underset{n,m\u27f6\infty}{lim}d({x}_{n},{x}_{m})=0$. Therefore, ${\left\{{x}_{n}\right\}}_{n\in \mathbb{N}}$ is a Cauchy sequence and there exists $u\in A$ such that ${x}_{n}\u27f6u$ as $n\u27f6\infty $.

Using the continuity of f, we get $f{x}_{n}\u27f6fu$ as $n\u27f6\infty $. Now, using the continuity of the rectangular metric function, we obtain $d({x}_{n+1},f{x}_{n})$ converges to $d(u,fu)$ as $n\u27f6\infty $.

Since $d({x}_{n+1},f{x}_{n})=d(A,B)$, the sequence ${\left\{d({x}_{n+1},f{x}_{n})\right\}}_{n}$ is constant. Consequently, $d(u,fu)=d(A,B)$. Then, u is a best proximity point of f.

In order to prove the uniqueness of the best proximity point

u, we assume that there exist

u and

${u}^{\prime}$ such that

Knowing that the pair

$(A,B)$ has the

P-property, from (

13) and (14), we get

$d(u,{u}^{\prime})=d(fu,f{u}^{\prime})$. Since

f is a

G-contraction, we obtain

$d(u,{u}^{\prime})=d(fu,f{u}^{\prime})\le \alpha d(u,{u}^{\prime})$, which holds unless

□

**Definition** **11.** Let $f:A\u27f6B$ be a mapping. Define ${X}_{f}\left({G}_{{A}_{0}}\right)$ as **Definition** **12.** Let A and B be two non-empty subsets of $(X,d)$. A mapping $f:A\u27f6B$ is said to be a G-weakly contractive mapping if for all $x,y\in A$, $x\ne y$ with $(x,y)\in E\left(G\right)$:

- (i)
$d(fx,fy)\le d(x,y)-\psi \left(d\right(x,y\left)\right)$, where $\psi :[0,\infty )\u27f6[0,\infty )$ is a continuous and nondecreasing function such that ψ is positive on $(0,\infty )$, $\psi \left(0\right)=0$ and $\underset{t\to \infty}{lim}\psi \left(t\right)=\infty$. If A is bounded, then the infinity condition can be omitted.

- (ii)
$\left.\begin{array}{cc}d({x}_{1},fx)\hfill & =d(A,B)\hfill \\ d({y}_{1},fy)\hfill & =d(A,B)\hfill \end{array}\right\}\u27f9({x}_{1},{y}_{1})\in E\left(G\right),\phantom{\rule{4pt}{0ex}}\phantom{\rule{4pt}{0ex}}\forall {x}_{1},{y}_{1}\in A.$

Our second main result is as follows:

**Theorem** **2.** Let $(X,d)$ be a complete rectangular metric space endowed with a directed graph, A and B be two nonempty closed subsets of $(X,d)$ such that $(A,B)$ has the P-property. Let $f:A\u27f6B$ be a continuous G-weakly contractive mapping such that $f\left({A}_{0}\right)\subseteq {B}_{0}$. Assume that d is continuous and ${A}_{0}$ is a closed nonempty set. Then, there exists a sequence ${\left\{{x}_{n}\right\}}_{n\in \mathbb{N}}$ in ${A}_{0}$ such that $d({x}_{n+1},f{x}_{n})=d(A,B)$ for $n\in \mathbb{N}$. Moreover, f has a unique best proximity point.

**Proof.** It follows from the definition of ${A}_{0}$ and ${B}_{0}$ that for every $x\in {A}_{0}$, there exists $y\in {B}_{0}$ such that $d(x,y)=dist(A,B)$. Conversely, for every ${y}^{\prime}\in {B}_{0}$ there exists ${x}^{\prime}\in {A}_{0}$ such that $d({x}^{\prime},{y}^{\prime})=dist(A,B)$. Since $f\left({A}_{0}\right)\subset {B}_{0}$, for every $x\in {A}_{0}$ there exists $y\in {A}_{0}$ such that $d(y,fx)=dist(A,B)$.

Let

${x}_{0}\in {X}_{f}\left({G}_{{A}_{0}}\right)$, then there exists

${x}_{1}\in {A}_{0}$ such that

$({x}_{0},{x}_{1})\in E\left(G\right)$ and

$d({x}_{1},f{x}_{0})=dist(A,B)$. On the other hand, since

${x}_{1}\in {A}_{0}$ and

$f\left({A}_{0}\right)\subset {B}_{0}$, there exists

${x}_{2}\in {A}_{0}$ such that

$d({x}_{2},f{x}_{1})=dist(A,B)$ and because

f is a

G-weakly contractive mapping, we get

$({x}_{1},{x}_{2})\in E\left(G\right)$. We repeat this process in a similar way, we build a sequence

$\left\{{x}_{n}\right\}$ in

${A}_{0}$ such that

Since the pair

$(A,B)$ has the

P-property, we conclude that

$d({x}_{n},{x}_{n+1})=d(f{x}_{n-1},f{x}_{n})$ for all

$n\in \mathbb{N}$. Then, for any positive integer

nIf we denote by

${v}_{n}=d({x}_{n},{x}_{n+1})$, from (

18),

$\left\{{v}_{n}\right\}$ is a nonnegative decreasing sequence. Hence,

$\left\{{v}_{n}\right\}$ converges to some real number

$v\ge 0$. Suppose that

$v>0$. As

$\psi $ is increasing, for any positive integer

n, we have

At the limit,

$v\le v-\psi \left(v\right)<v$, which is a contradiction, so

$v=0$, that is,

Now, let us prove that $\left\{{x}_{n}\right\}$ is a Cauchy sequence.

For any

$\u03f5>0$, choose

N such that

Let $B[{x}_{N},\u03f5]:=\{x\in X:d({x}_{N},x)<\u03f5\}$ be a closed ball with center ${x}_{N}$ and radius $\u03f5$. We claim that $f\left(B[{x}_{N},\u03f5]\right)\subseteq B[f{x}_{N-1},\u03f5]$.

Using the P-property, we obtain

$\left.\begin{array}{cc}d({x}_{N},f{x}_{N-1})\hfill & =dist(A,B)\hfill \\ d({x}_{N+1},f{x}_{N})\hfill & =dist(A,B)\hfill \end{array}\right\}\u27f9$ Consider $x\in B[{x}_{N},\u03f5]$, i.e., $d({x}_{N},x)\le \u03f5$. We distinguish two cases $d({x}_{N},x)\le {\displaystyle \frac{\u03f5}{2}}$ and $d({x}_{N},x)>{\displaystyle \frac{\u03f5}{2}}$.

**Case 1:**$d({x}_{N},x)\le {\displaystyle \frac{\u03f5}{2}}$.

Using the rectangular inequality, we distinguish the following two subcases:

• If

$f{x}_{N-1}=f{x}_{N+1}$,

$f{x}_{N+2}=fx$ and

$f{x}_{N+1}\ne f{x}_{N+2}$, we have

In the case where $f{x}_{N+1}=f{x}_{N+2}$, we obtain $d(f{x}_{N-1},fx)=0$.

• If

$f{x}_{N-1}\ne f{x}_{N+1}$,

$f{x}_{N+2}\ne fx$ and

$f{x}_{N+1}\ne f{x}_{N+2}$, we have

which implies that

$fx\in B[f{x}_{N-1},\u03f5]$.

**Case 2:**$\frac{\u03f5}{2}}<d({x}_{N},x)\le \u03f5$.

• If

$f{x}_{N-1}=f{x}_{N+1}$,

$f{x}_{N}=fx$ and

$f{x}_{N+1}=f{x}_{N}$, we get

• If

$f{x}_{N-1}\ne f{x}_{N+1}$,

$f{x}_{N}\ne fx$ and

$f{x}_{N+1}\ne f{x}_{N}$, we have

Then,

$d(f{x}_{N-1},fx)\le \u03f5$, which gives that

$fx\in B[f{x}_{N-1},\u03f5]$. Thus, we obtain that

Claim: If

$y\in B[f{x}_{N-1},\u03f5]$ with

$d(x,y)=dist(A,B)$ for some

$x\in {A}_{0}$, then

$x\in B[{x}_{N},\u03f5]$.

Let

$y\in B[f{x}_{N-1},\u03f5]$. Then,

Assume that there exists

$x\in {A}_{0}$ such that

$d(x,y)=dist(A,B)$. From (17), we get

$d({x}_{N},f{x}_{N-1})=dist(A,B)$ which gives us using the

P-property,

From (

25) and (

26), we obtain that

$d(x,{x}_{N})\le \u03f5$, i.e.,

$x\in B[{x}_{N},\u03f5]$ and the claim is proved.

From (

21) and (

23), we have

${x}_{N+1}\in B[{x}_{N},\u03f5]$. Then, using (

24), we get

$f{x}_{N+1}\in B[f{x}_{N-1},\u03f5]$, i.e.,

Since

$d({x}_{N+2},f{x}_{N+1})=dist(A,B)$, by the precedent claim

$d({x}_{N+2},f{x}_{N})\le \u03f5$. Again, from (

24),

$d({x}_{N+2},f{x}_{N-1})\le \u03f5$ and from the claim

$d({x}_{N+3},f{x}_{N})\le \u03f5$. In this way, we obtain

Thus, the sequence

$\left\{{x}_{n}\right\}$ is Cauchy. Since

A is a closed subset of the complete rectangular metric space, there exists

${x}^{\ast}\in A$ such that

From the continuity of

f, we obtain

Then, using the continuity of the rectangular metric, we obtain

From (17),

$d({x}_{N+1},{x}_{N})=dist(A,B)$, we conclude that

${\left\{d({x}_{N+1},{x}_{N})\right\}}_{N}$ is a constant sequence equal to

$dist(A,B)$. Therefore, from (

31),

$d({x}^{\ast},f{x}^{\ast})=dist(A,B)$. Thereby,

${x}^{\ast}$ is a best proximity point of

f.

Let us prove the uniqueness of the best proximity point. Consider

${x}_{1},{x}_{2}$ two different best proximity points. Then,

$d({x}_{1},f{x}_{1})=d({x}_{2},f{x}_{2})=dist(A,B)$. From the

P-property, we obtain

$d({x}_{1},{x}_{2})=d(f{x}_{1},f{x}_{2})$. Using that

f is weakly

G-contractive, we get

which is a contradiction. Therefore,

${x}_{1}={x}_{2}$. □

**Definition** **13.** Let $(X,d)$ be a rectangular metric space and G be a directed graph. Let $A,B$ be two nonempty subsets of X. A non-self mapping $T:A\u27f6B$ is said to be

a G- proximal Kannan mapping if for $x,y,u,v\in A$, there exists $b\in [0,\frac{1}{2})$ such that

$\left.\begin{array}{cc}(x,y)\hfill & \in E\left(G\right)\hfill \\ d(u,Tx)\hfill & =d(A,B)\hfill \\ d(v,Ty)\hfill & =d(A,B)\hfill \end{array}\right\}\u27f9d(u,v)\le b[d(x,v)+d(y,u)].$

proximally G-edge preserving if for each $x,y,u,v\in A$

$\left.\begin{array}{cc}(x,y)\hfill & \in E\left(G\right)\hfill \\ d(u,Tx)\hfill & =d(A,B)\hfill \\ d(v,Ty)\hfill & =d(A,B)\hfill \end{array}\right\}\u27f9(u,v)\in E\left(G\right)$.

Our third main result is as follows:

**Theorem** **3.** Let $(X,d)$ be a rectangular metric space and G a directed graph. Let $A,B$ be two nonempty closed subsets of X. Assume that ${A}_{0}$ is nonempty and d is continuous. Let $T:A\u27f6B$ be a continuous non-self mapping satisfying the following properties:

**Proof.** From (

33), there exist

${x}_{0},{x}_{1}\in {A}_{0}$ such that

Since

$T\left({A}_{0}\right)\subseteq {B}_{0}$, we have

$T{x}_{1}\in {B}_{0}$ and there exists

${x}_{2}\in {A}_{0}$ such that

Using the proximally

G-edge preserving of

T, (

34) and (

35), we get

$({x}_{1},{x}_{2})\in E\left(G\right)$. By continuing this process, we obtain the sequence

$\left\{{x}_{n}\right\}$ in

${A}_{0}$ such that

Now, let us prove that

$\left\{{x}_{n}\right\}$ is a Cauchy sequence in

A. Note that if there exists

${n}_{0}\in \mathbb{N}$ such that

${x}_{{n}_{0}}={x}_{{n}_{0}+1}$, from (

36), we get that

${x}_{{n}_{0}}$ is a best proximity point of

T. Therefore, we may assume that

${x}_{n-1}\ne {x}_{n}$ for all

$n\in \mathbb{N}$.

Since

T is a

G-proximal Kannan mapping for each

$n\in \mathbb{N}$, we obtain

$({x}_{n-1},{x}_{n})\in E\left(G\right)$,

$d({x}_{n},T{x}_{n-1})=d(A,B)$ and

$d({x}_{n+1},T{x}_{n})=d(A,B)$ which imply that

As $b<{\displaystyle \frac{1}{2}}$, then $d({x}_{n},{x}_{n+1})\u27f60$ as $n\u27f6\infty $. Let $p\ge 1$.

Knowing that

$\sum _{k=n}^{n+2p-1}C{b}^{k}\u27f60$ as

$n,p\u27f6\infty $, we shall prove that

$d({x}_{n+2p-2},{x}_{n+2p})\u27f60$ as

$n,p\u27f6\infty $. From (

36), we can conclude that

On the other hand, from (

37) we get

$({x}_{n+2p-1},{x}_{n+2p})\in E\left(G\right)$ and

$({x}_{n+2p},{x}_{n+2p+1})\in E\left(G\right)$. Then, since

G is a connected graph, there exists a path between

${x}_{n+2p-1}$ and

${x}_{n+2p+1}$ in

G. Therefore,

Knowing that

T is a

G-proximal Kannan mapping and from (

41)–(

43), we obtain

Therefore, from (

40), we conclude that

$d({x}_{n},{x}_{n+2p})\u27f60$ as

$n,p\u27f6\infty $. It follows that

$\left\{{x}_{n}\right\}$ is a Cauchy sequence in

A. Since

A is closed, there exists

${x}^{\ast}\in A$ such that

${x}_{n}\u27f6{x}^{\ast}$ as

$n\u27f6\infty $. By the continuity of

T, we obtain

$T{x}_{n}\u27f6T{x}^{\ast}$ as

$n\u27f6\infty $. Since

d is assumed to be continuous, we get

$d({x}_{n+1},T{x}_{n})\u27f6d({x}^{\ast},T{x}^{\ast})$ as

$n\u27f6\infty $. By (

36), we conclude that

Thus, ${x}^{\ast}$ is a best proximity point of T and the sequence $\left\{{x}_{n}\right\}$ defined by $d({x}_{n+1},T{x}_{n})=d(A,B)$ converges to ${x}^{\ast}$ for all $n\in \mathbb{N}$.

Let us prove the uniqueness of the best proximity point ${x}^{\ast}$. Suppose that ${x}_{1}^{\ast}$ and ${x}_{2}^{\ast}$ are two best proximity points. Then, we obtain $d({x}_{1}^{\ast},T{x}_{1}^{\ast})=d(A,B)$, $d({x}_{2}^{\ast},T{x}_{2}^{\ast})=d(A,B)$ and $({x}_{1}^{\ast},{x}_{2}^{\ast})\in E\left(G\right)$, which gives $d({x}_{1}^{\ast},{x}_{2}^{\ast})\le b[d({x}_{1}^{\ast},{x}_{2}^{\ast})+d({x}_{1}^{\ast},{x}_{2}^{\ast})]=2bd({x}_{1}^{\ast},{x}_{2}^{\ast})$. Therefore, we get $(1-2b)d({x}_{1}^{\ast},{x}_{2}^{\ast})\le 0$, which implies that $1-2b\le 0$$\u27f9b\ge {\displaystyle \frac{1}{2}}$. It is a contradiction with respect to $b<{\displaystyle \frac{1}{2}}$. Then, $d({x}_{1}^{\ast},{x}_{2}^{\ast})=0$, that is, ${x}_{1}^{\ast}={x}_{2}^{\ast}$ and so the uniqueness of the best proximity point follows. □