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.

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.

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.

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...

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...

In the 1920s, algebraic topology began to develop partially due to the need for new topological techniques in solving problems in xed point theory. Indeed, the celebrated Lefschetz xed point theorem is a far reaching generalization of the well-known Brouwer xed point theorem. The eld of topological xed point theory continued to ourish through the 1940s during which much of the foundations was l...

recently, cho et al. [y. j. cho, r. saadati, s. h. wang, common xed point theorems on generalized distance in ordered cone metric spaces, comput. math. appl. 61 (2011) 1254-1260] dened the concept of the c-distance in a cone metric space and proved some xed point theorems on c-distance. in this paper, we prove some new xed point and common xed point theorems by using the distance in ordere...

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...