$b$-metric spaces with a graph and best proximity points for some contractions
الموضوعات :
1 - Department of Mathematics, Payame Noor University, Tehran, Iran
2 - Department of Mathematics, Payame Noor University, Tehran, Iran
الکلمات المفتاحية: fixed point, Best proximity point, $G$-continuous mapping,
ملخص المقالة :
In this paper, we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph. Then we support our main theorem by a non-trivial example and give some consequences of it for usual graphs.
[1] I. A. Bakhtin, The contraction mapping principle in quasimetric spaces, Func. Anal. Gos. Ped. Inst. Unianowsk. 30 (1989), 26-37.
[2] J. A. Bondy, U. S. R. Murty, Graph Theory, Springer, 2008.
[3] S. Czerwik, Contraction mappings in b-metric spaces, Acta Math. Inform. Univ. Ostrav. 1 (1) (1993), 5-11.
[4] K. Fallahi, A. Petrusel, G. Soleimani Rad, Fixed point results for pointwise Chatterjea type mappings with respect to a c-distance in cone metric spaces endowed with a graph, U.P.B. Sci. Bull. (Series A). 80 (2018), 47-54.
[5] K. Fallahi, G. Soleimani Rad, Best proximity points theorem in b-metric spaces endowed with a graph, Fixed Point Theory. 21 (2) (2020), 465-474.
[6] J. Jachymski, The contraction principle for mappings on a metric space with a graph, Proc. Amer. Math. Soc. 136 (2008), 1359-1373.
[7] S. Reich, Some remarks concerning contraction mappings, Canad. Math. Bull. 14 (1971), 121-124.
[8] V. Sankar Raj, A best proximity point theorem for weakly contractive non-self-mappings, Nonlinear Anal. 74 (2011), 4804-4808.
[9] V. Sankar Raj, Best proximity point theorems for non-self mappings, Fixed Point Theory. 14 (2013), 447-454.
[10] S. Sadiq Basha, Discrete optimization in partially ordered sets, J. Glob. Optim. 54 (2012), 511-517.
[11] S. Sadiq Basha, N. Shahzad, C. Vetro, Best proximity point theorems for proximal cyclic contractions, J. Fixed Point Theory Appl. 19 (4) (2017), 2647-2661.
