## Common fixed points under strict contractive conditions.(English)Zbl 0977.54038

J. Math. Anal. Appl. 248, No. 1, 327-332 (2000); erratum ibid. 274, No. 2, 879-880 (2002).
Let $$(X,d)$$ be a metric space and $$f,g:X\to X$$ two mappings. The authors present some common fixed point theorems, for $$f$$ and $$g$$, under strict contractive conditions by using a minimal commutativity condition.

### MSC:

 54H25 Fixed-point and coincidence theorems (topological aspects) 47H10 Fixed-point theorems

### Keywords:

noncompatible mapping; contractive pair; common fixed point
Full Text:

### References:

 [1] Jachymski, J., Common fixed point theorems for some families of maps, Indian J. pure appl. math., 25, 925-937, (1994) · Zbl 0811.54034 [2] Jungck, G., Compatible mappings and common fixed points, Internat. J. math. math. sci., 9, 771-779, (1986) · Zbl 0613.54029 [3] Jungk, G.; Moon, K.B.; Park, S.; Rhoades, B.E., On generalizations of the meir – keeler type contraction maps: corrections, J. math. anal. appl., 180, 221-222, (1993) · Zbl 0790.54055 [4] Pant, R.P., Common fixed points of two pairs of commuting mappings, Indian J. pure appl. math., 17, 187-192, (1986) · Zbl 0581.54031 [5] Pant, R.P., Common fixed points of weakly commuting mappings, Math. student, 62, 97-102, (1993) · Zbl 0878.54030 [6] Pant, R.P., Common fixed points of noncommuting mappings, J. math. anal. appl., 188, 436-440, (1994) · Zbl 0830.54031 [7] Pant, R.P., Common fixed points of sequences of mappings, Ganita, 47, 43-49, (1996) · Zbl 0892.54028 [8] Pant, R.P., Common fixed points of contractive maps, J. math. anal. appl., 226, 251-258, (1998) · Zbl 0916.54027 [9] Pant, R.P., R-weak commutativity and common fixed points, Soochow J. math., 25, 37-42, (1999) · Zbl 0918.54038
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.