In this paper, we present yet another new and novel variant of classical Banach contraction principle on a complete metric space endowed with a binary relation which, under universal relation, reduces to Banach contraction principle. In process, we observe that various kinds of binary relations, such as partial order, preorder, transitive relation, tolerance, strict order, symmetric closure, etc., utilized by earlier authors in several well-known metrical fixed point theorems can be weakened to the extent of an arbitrary binary relation.Mathematics Subject Classification. 47H10, 54H25.

In this article, we generalize some frequently used metrical notions such as: completeness, closedness, continuity, -continuity and compatibility to relation-theoretic setting and utilize these relatively weaker notions to prove our results on the existence and uniqueness of coincidence points involving a pair of mappings defined on a metric space endowed with an arbitrary binary relation. Particularly, under universal relation our results deduce the classical coincidence point theorems of Goebel, Jungck and others. Furthermore, our results generalize, modify, unify and extend several well-known results of the existing literature.

No abstract

In this article, we prove some existence and uniqueness results on coincidence points for g-increasing mappings satisfying generalized ϕ-contractivity conditions in ordered metric spaces. As an application of one of our newly proved results, we indicate the formulation of a coupled coincidence theorem. Our results generalize, extend, modify, improve, sharpen, enrich, and complement several well-known results of the existing literature. Also, we point out that a recent coincidence point result proved in

We observe that the notion of common property E.A. relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.