ITERATIVE ALGORITHMS AND FIXED POINT THEOREMS FOR SET-VALUED G-CONTRACTIONS IN GRAPHICAL CONVEX METRIC SPACES

In this article, we present a series of fixed point results of the Ishikawa iterative algorithm and the SP iterative algorithm in graphical convex metric spaces. First, we introduce the Ishikawa sequence and the SP sequence in the above space. Furthermore, we study the existence and uniqueness of fixed points for set-valued G-contractions in graphical convex metric spaces. Finally, by providing an example, we demonstrate the hypotheses of the existence theorem of fixed points for set-valued G-contractions in G-complete graphical convex metric spaces are sufficient but not necessary.