A polytopal digraph G(P ) is an orientation of the skeleton of a convex polytope P . The possible non-degenerate pivot operations of the simplex method in solving a linear program over P can be represented as a special polytopal digraph known as an LP digraph. Presently there is no general characterization of which polytopal digraphs are LP digraphs, although four necessary properties are known...

The purpose of this paper is to establish some weak convergence theorems of modified two-step iteration process with errors for two asymptotically quasi-nonexpansive non-self mappings in the setting of real uniformly convex Banach spaces if E satisfies Opial’s condition or the dual E∗ of E has the Kedec-Klee property. Our results extend and improve some known corresponding results from the exis...

Abstract The necessary and sufficient conditions for both the Kadec–Klee property as well with respect to coordinatewise convergence in Orlicz–Lorentz sequence spaces equipped Orlicz norm generated by arbitrary functions any non-increasing weight sequences are given. Moreover, their subspaces of elements an order continuous full characterization is presented. Some tools useful proofs main resul...

We consider the notion of a uniformly concave function, using it to characterize those Lorentz spaces Lw,1 that have the weak-star uniform Kadec-Klee property as precisely those for which the antiderivative φ of w is uniformly concave; building on recent work of Dilworth and Hsu. We also derive a quite general sufficient condition for a twice-differentiable φ to be uniformly concave; and explor...

We introduce an iterative scheme for finding a common element of the set of solutions of generalizedmixed equilibrium problems and the set of fixed points for countable families of total quasi-φasymptotically nonexpansive mappings in Banach spaces. We prove a strong convergence theorem of the iterative sequence generated by the proposed iterative algorithm in an uniformly smooth and strictly co...

The purpose of this paper is to use the modified block iterative method to propose an algorithm for solving the convex feasibility problems for an infinite family of quasi-φ-asymptotically nonexpansive mappings. Under suitable conditions some strong convergence theorems are established in uniformly smooth and strictly convex Banach spaces with Kadec-Klee property. The results presented in the p...

We focus on a specific class of planar cubic bridgeless graphs, namely the klee-graphs. K4 is the smallest klee-graph and having a klee-graph G we create another klee-graph by replacing any vertex of G by a triangle, i.e., applying Y∆ operation. In this paper, we prove that every klee-graph with n ≥ 8 vertices has at least 3 · 2 perfect matchings, improving the 2 bound inherited from the genera...