in this paper, we prove the existence of the solution for boundary value prob-lem(bvp) of fractional dierential equations of order q 2 (2; 3]. the kras-noselskii's xed point theorem is applied to establish the results. in addition,we give an detailed example to demonstrate the main result.

Jachymski [ Proc. Amer. Math. Soc., 136 (2008), 1359-1373] gave modified version of a Banach fixed point theorem on a metric space endowed with a graph. In the present paper, (G, Φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. Also, Hardy-Rogers G-contraction have been introduced and some fixed point theorems have been proved. S...

The theory of fixed point is a very extensive field, which has various applications. The present paper deals with some developments of Meir-Keeler type fixed point theorem as its remarkable generalizations under several contractive definitions in metric space.

‎inspired by the work of suzuki in‎ ‎[t. suzuki‎, ‎a generalized banach contraction principle that characterizes metric completeness‎, proc‎. ‎amer‎. ‎math‎. ‎soc. ‎136 (2008)‎, ‎1861--1869]‎, ‎we prove a fixed point theorem for contractive mappings‎ ‎that generalizes a theorem of geraghty in [m.a‎. ‎geraghty‎, ‎on contractive mappings‎, ‎proc‎. ‎amer‎. ‎math‎. ‎soc., ‎40 (1973)‎, ‎604--608]‎an...

‎Inspired by the work of Suzuki in‎ ‎[T. Suzuki‎, ‎A generalized Banach contraction principle that characterizes metric completeness‎, Proc‎. ‎Amer‎. ‎Math‎. ‎Soc. ‎136 (2008)‎, ‎1861--1869]‎, ‎we prove a fixed point theorem for contractive mappings‎ ‎that generalizes a theorem of Geraghty in [M.A‎. ‎Geraghty‎, ‎On contractive mappings‎, ‎Proc‎. ‎Amer‎. ‎Math‎. ‎Soc., ‎40 (1973)‎, ‎604--608]‎an...

In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity i...

In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity i...