In this paper, we prove some coupled fixed point theorems satisfying a Meir-Keeler type contractive condition for mappings enjoying the mixed monotone property in ordered partial metric spaces.

In this paper we prove coupled fixed point theorem for mapping having the mixed monotone property in partially ordered metric space. We give an example to support of our result.

*Correspondence: [email protected] 1Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok, 65000, Thailand 2Centre of Excellence in Mathematics, CHE, Si Ayutthaya Road, Bangkok, 10400, Thailand Abstract In this paper, we establish some coupled coincidence and coupled common fixed point theorems for nonlinear contractive mappings having the mixed monotone property in par...

We extend the recent results of coupled coincidence point theorems of Shatanawi et. al. (2012) by weakening the concept of mixed g-monotone property. We also give an example of a nonlinear contraction mapping, which is not applied to the existence of coupled coincidence point by the results of Shatanawi et. al. but can be applied to our results. The main results extend and unify the results of ...

The monotone crossing number of G is defined as the smallest number of crossing points in a drawing of G in the plane, where every edge is represented by an x-monotone curve, that is, by a connected continuous arc with the property that every vertical line intersects it in at most one point. It is shown that this parameter can be strictly larger than the classical crossing number cr(G), but it ...

For a graph property P, the edit distance of a graph G from P, denoted EP(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the furthest graph on n vertices from P and what is the largest possible edit distance from P? Denote this maximal distance by ed(n,P). This question is motivated by algor...