in this paper, we give a new fixed point theorem forweakly quasi-contraction maps in metric spaces. our results extend and improve some fixed point and theorems in literature.

In this paper, we introduce a cone generalized semi-cyclicφ−contraction maps and prove best proximity points theorems for such mapsin cone metric spaces. Also, we study existence and convergence results ofbest proximity points of such maps in normal cone metric spaces. Our resultsgeneralize some results on the topic.

Using elementary hyperbolic geometry, we give an explicit formula for the contraction constant of skinning map over moduli spaces relatively acylindrical manifolds.

‎In this work‎, ‎we investigate admitting center map on multiplicative metric space‎ ‎and establish some fixed point theorems for such maps‎. ‎We modify the Banach contraction principle and‎ ‎the Caristi's fixed point theorem for M-contraction admitting center maps and we prove some‎ ‎useful theorems‎. ‎Our results on multiplicative metric space improve and modify‎ ‎s...

In this paper, we give a new fixed point theorem forWeakly quasi-contraction maps in metric spaces. Our results extend and improve some fixed point and theorems in literature.    

In this paper, several fixed point theorems for T-contraction of two maps on cone metric spaces under normality condition are proved. Obtained results extend and generalize well-known comparable results in the literature.

in this paper, several xed point theorems for t-contraction of two maps on cone metric spaces under normality condition are proved. obtained results extend and generalize well-known comparable results in the literature.

Pattern Recognition and Image Processing Group Institute of Computer Aided Automation Vienna University of Technology Treitlstr. 3/1832 A-1040 Vienna AUSTRIA Phone: +43 (1) 58801-18351 Fax: +43 (1) 5054668 E-mail: [email protected], [email protected] URL: http://www.prip.tuwien.ac.at/ PRIP-TR-54 January 29, 1999 Dual Contraction of Combinatorial Maps Luc Brun and Walter Kropatsch1 Abs...

Graph pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids overcome the main limitations of their regular ancestors. The graphs used in the pyramid may be region adjacency graphs, dual graphs or combinatorial maps. Compared to usual graph data structures, combinatorial maps offer an explicit encoding of the orientation of edges around vertices. Each c...