and Applied Analysis 3 It is easy to see that a quasi-nonexpansive mapping is an asymptotically quasi-nonexpansive mapping with the sequence {1}. T is said to be asymptotically nonexpansive in the intermediate sense if and only if it is continuous, and the following inequality holds: lim sup n→∞ sup x,y∈C (∥ ∥Tx − Tny∥∥ − ∥∥x − y∥∥) ≤ 0. 2.6 T is said to be asymptotically quasi-nonexpansive in ...

The k-core of a graph is the largest subgraph of minimum degree at least k. We show that for k sufficiently large, the (k + 2)-core of a random graph G(n, p) asymptotically almost surely has a spanning k-regular subgraph. Thus the threshold for the appearance of a k-regular subgraph of a random graph is at most the threshold for the (k + 2)-core. In particular, this pins down the point of appea...

The asymptotic properties of random regular graphs are objects of extensive study in mathematics and physics. In this paper we argue, using the theory of spin glasses in physics, that in random regular graphs the maximum cut size asymptotically equals the number of edges in the graph minus the minimum bisection size. Maximum cut and minimal bisection are two famous NP-complete problems with no ...

We show some stability and convergence theorems of the modified Ishikawa iterative sequence with errors for a strongly successively pseudocontractive and strictly asymptotically pseudocontractive mapping in a real Banach space. Additionally, we prove that if T is a uniformly Lipschitzian strongly accretive mapping, the modified Ishikawa iteration sequence with errors converges strongly to the u...

In this paper, first, we introduce the condition (BP) which is weaker than the completely continuous mapping in Banach spaces. Second, we consider a simple iteration and prove some strong convergence theorems of the proposed iteration for an asymptotically nonexpansive nonself-mapping with the condition (BP). Finally, we give two examples to illustrate the main result in this paper. Our results...

Let G be a K4-free 4-regular connected graph with & vertices. Then G contains an independent set of vertices of cardinality at least (7&&4) 26. Furthermore, the proof will yield a polynomial-time algorithm which will return an independent set of cardinality at least (7&&4) 26 for any such graph. A family of K4 -free 4-regular connected graphs with maximum independent set of cardinality 3 11& is...

Approximate fixed point property problem for Mann iteration sequence of a nonexpansive mapping has been resolved on a Banach space independent of uniform (strict) convexity by Ishikawa [Fixed points and iteration of a nonexpansive mapping in a Banach space, Proc. Amer. Math. Soc. 59 (1976), 65–71]. In this paper, we solve this problem for a class of mappings wider than the class of asymptotical...

We introduce an iterative process which converges strongly to a common point of solution of variational inequality problem for a monotone mapping and fixed point of uniformly Lipschitzian relatively asymptotically nonexpansive mapping in Banach spaces. As a consequence, we provide a scheme that converges strongly to a common zero of finite family of monotone mappings under suitable conditions. ...