Common Fixed Point for Compatible Mappings of Type () Satisfying an Implicit Relation
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
Here we prove a common fixed point theorem for compatible mappings of type () satisfying an implicit relation. We extend results of Popa [9] for five mappings.
Authors and Affiliations
Jayesh Tiwari
Keywords
Related Articles
- EP ID EP531611
- DOI 10.5958/2320-3226.2018.00005.X
- Views 145
- Downloads 0
MAHLER MEASURE OF CHARGED GRAPHS OVER THE PURE CUBIC FIELD Q ( )
In this paper, the algebraic integer as a edge label from the pure cubic field to the all vertices of the simple graphs thereafter charges to all the vertices and get the edge labeled charged graphs. Further to find the...
DOMINATION IN CARTESIAN PRODUCT OF FUZZY GRAPHS USING STRONG ARC
In this paper the domination in fuzzy graphs by using strong arcs are generalized and established the domination concept in Cartesian product on standard fuzzy graphs using strong arcs and non strong arcs
A NOTE ON SEMIDERIVATIONS
Recently, Filippis et al. introduced the notion of generalized semiderivation [[5], Definition 1.2] in prime rings. Accordingly, let R be a prime ring and F: R→R be an additive mapping. If there exists a semiderivation d...
ON FUNCTIONS OF A SINGLE MATRIX ARGUMENT - III
We prove some Eulerian integrals involving the hypergeometric functions of single matrix argument. The integrals studied here involve the and the functions of matrix argument. We apply the Mathai’s matrix transform t...
REMOVING NON-RELEVANT LINKS FROM TOP SEARCH RESULTS USING FEATURE SCORE COMPUTATION
To promote website in search engine rankings in order to get better visibility and more traffic, search engine optimizers have to follow legal ways but some search engine optimizers manipulate the web pages and boost the...