The purpose of this paper is to establish some coupled coincidence point theorems for a pair of mappings having a mixed g-monotone property satisfying a contractive condition of rational type in the framework of partially ordered metric spaces. Also, we present a result on the existence and uniqueness of coupled common fixed points. The results presented in the paper generalize and extend sever...

In this paper, we have established coupled coincidence point results for pair of mappings in partially ordered G-metric spaces. We have defined w-compatibility in this context to ensure the uniqueness of the coupled common fixed point. There are several corollaries which extend some known results of coupled coincidence points and coupled fixed points. The main theorem is illustrated with an exa...

The aim of this paper is to prove a common fixed point theorem for variants of weak compatible maps in a complex valued metric space. As a consequence, we extend and generalize the theorem of Branciari [3] for 2812 a pair of weakly compatible mappings satisfying a general contractive condition of integral type in complex valued metric space. At last, we prove two results by using E.A. property ...

Schema matching, the problem of finding mappings between the attributes of two semantically related database schemas, is an important aspect of many database applications such as schema integration, data warehousing, and electronic commerce. Unfortunately, schema matching remains largely a manual, labor-intensive process. Furthermore, the effort required is typically linear in the number of sch...

Schema matching, the problem of nding mappings between the attributes of two semantically related database schemas, is an important aspect of many database applications such as schema integration, data warehousing, and electronic commerce. Unfortunately, schema matching remains largely a manual, labor-intensive process. Furthermore, the eeort required is typically linear in the number of schema...

In this paper, we introduce the notion of strictly (α,ψ,ξ)-G-contractive mappings in b-metric spaces endowed with a graph G. We establish a sufficient condition for existence and uniqueness of points of coincidence and common fixed points for such mappings. Our results extend and unify many existing results in the literature. Finally, we construct some examples to analyze and support our results.

Recall that one of the most commonly used reductions is the L-reduction, introduced by Papadim­ itriou and Yannakakis in [?]. This reduction consists of a pair of polynomial mappings (f(.), g(.)) where f maps an instance x of the problem A we are reducing from to an instance x/ of the problem B we are reducing to, and g maps a feasible solution y/ (of x/ i.e. instance of B) to a feasible soluti...

In this paper we introduce the Jungck-Agarwal et al. iteration procedure and obtain strong convergence as well as stability results for a pair of non-self mappings. The results obtained are generalization of some existing results in the literature. In addition, we show that the rate of convergence of this newly defined iteration procedure is better than JungckMann, Jungck-Ishikawa and JungckNoo...

In this work, we introduce the notion of Menger probabilistic metric type space, on the other hand, we introduce a more general class of auxiliary functions in contractivity condition, following that, we obtain some multipled common fixed point theorems for a pair of mappings T : X×X · · · ×X } {{ } m-times → X and A : X→ X. As an application, we give out an example to demonstrate the validity ...

Given a mapping f : A → B from a (pre-)ordered set A into an unstructured set B, we study the problem of defining a suitable (pre-)ordering relation on B such that there exists a mapping g : B → A such that the pair of mappings (f, g) forms an adjunction between (pre-)ordered sets. The necessary and sufficient conditions obtained are then expressed in terms of closure operators and closure syst...