Some Fixed Point Theorems for G-Nonexpansive Mappings on Ultrametric Spaces and Non-Archimedean Normed Spaces with a Graph
Journal Title: Journal of Mathematics and Applications - Year 2016, Vol 39, Issue
Abstract
A very interesting approach in the theory of fixed point is some general structures was recently given by Jachymski by using the context of metric spaces endowed with a graph. The purpose of this article is to present some new fixed point results for G-nonexpansive mappings defined on an ultrametric space and non-Archimedean normed space which are endowed with a graph. In particular, we investigate the relationship between weak connectivity graph and the existence of fixed point for these mappings.
Authors and Affiliations
Hamid Mamghaderi, Hashem Parvaneh Masiha
On the Exponential Stability of a Neutral Differential Equation of First Order
In this work, we establish some assumptions that guaranteeing the global exponential stability (GES) of the zero solution of a neutral differential equation (NDE). We aim to extend and improves some results found in the...
Approximation by Szász Type Operators Including Sheffer Polynomials
In present article, we discuss voronowskaya type theorem, weighted approximation in terms of weighted modulus of continuity for Szász type operators using Sheffer polynomials. Lastly, we investigate statistical approxima...
Majorization problems for classes of analytic functions
The main object of the present paper is to investigate problems of majorization for certain classes of analytic functions of complex order defined by an operator related to the modified Bessel functions of first kind. Th...
On some differential sandwich theorems using an extended generalized Sălăgean operator and extended Ruscheweyh operator
In this work we define a new operator using the extended generalized Sălăgean operator and extended Ruscheweyh operator. Denote by DR_λ^{m,n} the Hadamard product of the extended generalized Sălăgean operator D_λ^m and e...
Number of Zeros of a Polynomial (Lacunary-type) in a Disk
The problem of finding out the region which contains all or a prescribed number of zeros of a polynomial P(z) := [formula] has a long history and dates back to the earliest days when the geometrical representation of com...