In a recent paper, Khojasteh emph{et al.} [F. Khojasteh, S. Shukla, S. Radenovi'c, A new approach to the study of fixed point theorems via simulation functions, Filomat, 29 (2015), 1189-–1194] presented a new class of simulation functions, say $mathcal{Z}$-contractions, with unifying power over known contractive conditions in the literature. Following this line of research, we extend and ...

In this paper, we present some fixed and coincidence point theorems for hybrid rational Geraghty contractive mappings in partially ordered $b$-metric spaces. Also, we derive certain coincidence point results for such contractions. An illustrative example is provided here to highlight our findings.

In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of self-mappings satisfying some generalized contractive type conditions in $b$-metric spaces endowed with graphs and altering distance functions. Finally, some examples are provided to justify the validity of our results.

Azam, A Fisfer, B, Khan, M: Common fixed point theorems in complex valued metric Spaces. Number. Funct. Anal. Optim. . 32(3), 243-253 (2011). B. C. Dhage, Generalized metric spaces and mappings with fixed point, Bull. Calcutt Math. Soc. 84 (1992), 329-336. B. C. Dhage, " On generalized metric spaces and topological structure. II," Pure and applied Mathematika Sciences, Vol. 40, no. 1-...

‎In this paper‎, ‎we introduce the concept of Su-type contractive mapping and establish fixed point theorems for such mappings in the setting of ordered‎ ‎extended partial $b$-metric space‎. ‎We also develop an‎ ‎application for Fredholm type integral equations to‎ ‎validate our main result and a non-trivial example is given to‎ ‎elucidate our work.

Let Fq denote a finite field with q elements and let V = (Fq)m,n be the Fq-vector space of matrices over Fq of type (m,n). On V we define the so-called rank metric distance by d(A,B) = rank(A−B) for A,B ∈ V . Clearly, the distance d is a translation invariant metric on V . A subset C ⊆ V endowed with the metric d is called a rank metric code with minimum distance d(C) = min {d(A,B) | A 6= B ∈ V...