In this paper, we discuss the existence and uniqueness of points of coincidence and common fixed points for a pair of graph preserving mappings in parametric $N_b$-metric spaces. As some consequences of this study, we obtain several important results in parametric $b$-metric spaces, parametric $S$-metric spaces and parametric $A$-metric spaces. Finally, we provide some illustrative examples to ...

Based on Stein’s method, we derive upper bounds for Poisson process approximation in the L1-Wasserstein metric d (p) 2 , which is based on a slightly adapted Lp-Wasserstein metric between point measures. For the case p = 1, this construction yields the metric d2 introduced in [Barbour, A. D. and Brown, T. C. (1992), Stochastic Process. Appl. 43(1), pp. 9–31], for which Poisson process approxima...

We consider the p-Laplacian operator on a domain equipped with a Finsler metric. We recall relevant properties of its first eigenfunction for finite p and investigate the limit problem as p →∞.

We consider the p–Laplacian operator on a domain equipped with a Finsler metric. After deriving and recalling relevant properties of its first eigenfunction for p > 1, we investigate the limit problem as p → 1.

In this paper, we prove the existence of fixed point for Chatterjea type mappings under $c$-distance in cone metric spaces endowed with a graph. The main results extend, generalized and unified some fixed point theorems on $c$-distance in metric and cone metric spaces.

In this paper we consider the so called a vector metric space, which is a generalization of metric space, where the metric is Riesz space valued. We prove some common fixed point theorems for three mappings in this space. Obtained results extend and generalize well-known comparable results in the literature.

In this article, we define the vector valued multiple of $chi^{2}$ over $p$-metric sequence spaces defined by Musielak and study some of their topological properties and some inclusion results.

‎The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$‎. ‎In this case‎, ‎$B$ is called a textit{metric basis} for $G$‎. ‎The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$‎. ‎Givi...