Fixed point theorems for two pairs of mappings satisfying a new type of common limit range property in G_p metric spaces
Journal Title: Annales Mathematicae Silesianae - Year 2018, Vol 32, Issue
Abstract
The purpose of this paper is to prove a general fixed point theorem for mappings involving almost altering distances and satisfying a new type of common limit range property in $G_p$ metric spaces. In the last part of the paper, some fixed point results for mappings satisfying contractive conditions of integral type and for $φ$-contractive mappings are obtained.
Authors and Affiliations
Valeriu Popa, Alina-Mihaela Patriciu
Keywords
Related Articles
- EP ID EP524998
- DOI 10.2478/amsil-2018-0002
- Views 144
- Downloads 0
Characterizations of rotundity and smoothness by approximate orthogonalities
In this paper we consider the approximate orthogonalities in real normed spaces. Using the notion of approximate orthogonalities in real normed spaces, we provide some new characterizations of rotundity and smoothness of...
Multipliers of uniform topological algebras
Let $E$ be a complete uniform topological algebra with Arens-Michael normed factors $(E_α)_{α∈Λ}$. Then $M(E)\cong\lim_{←}M(E_α)$ within an algebra isomorphism $φ$. If each factor $E_α$ is complete, then every multiplier...
A general fixed point theorem for implicit cyclic multi-valued contraction mappings
In this paper, a general fixed point theorem for cyclic multi-valued mappings satisfying an implicit relation from [19] different from implicit relations used in [13] and [23], generalizing some results from [22], [15],...
On the continuous dependence of solutions to orthogonal additivity problem on given functions
We show that the solution to the orthogonal additivity problem in real inner product spaces depends continuously on the given function and provide an application of this fact.
Gamma graphs of some special classes of trees
A set $S \subset V$ is a dominating set of a graph $G = (V,E)$ if every vertex $v \in V$ which does not belong to $S$ has a neighbour in $S$. The domination number $\gamma (G)$ of the graph $G$ is the minimum cardinality...