In this paper, we study the class of cubic (\alpha, \beta)-metrics. We show that every weakly Landsberg \beta)-metric has vanishing S-curvature. Using it, prove is a metric if and only it Berwald metric. This yields an extension Matsumoto's result for

equality of -curvatures of the berwald and cartan connections leads to a new class of finsler metrics, so-called bc-generalized landsberg metrics. here, we prove that every bc-generalized landsberg metric of scalar flag curvature with dimension greater than two is of constant flag curvature.

‎in this paper‎, ‎generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions‎. ‎also, we show that‎ there are examples which show that our main theorems are genuine generalizations of theorem 3.1 and 3.2 of cite{r}‎[ m.a. miandaragh, m. postolache, s. rezapour, ‎textit{approximate fixed points of generalizedconvex contractions},...

Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...

The metric dimension of a graph G is the minimum number of vertices in a subset S of the vertex set of G such that all other vertices are uniquely determined by their distances to the vertices in S. In this paper we investigate the metric dimension of the random graph G(n, p) for a wide range of probabilities p = p(n).

There has been much work on the Nirenberg problem: which function K(x) on S is the scalar curvature of a metric g on S pointwise conformal to the standard metric g0? It is quite natural to ask the following question on the half sphere S−: which function K(x) on S− is the scalar curvature of a metric g on S− which is pointwise conformal to the standard metric g0 with ∂S− being minimal with respe...

The metric dimension of a graph G is the minimum size of a subset S of vertices of G such that all other vertices are uniquely determined by their distances to the vertices in S. In this paper we investigate the metric dimension for two different models of random forests, in each case obtaining normal limit distributions for this parameter.

recently, rahimi et al. [comp. appl. math. 2013, in press] dened the conceptof quadrupled xed point in k-metric spaces and proved several quadrupled xed pointtheorems for solid cones on k-metric spaces. in this paper some quadrupled xed point resultsfor t-contraction on k-metric spaces without normality condition are proved. obtainedresults extend and generalize well-known comparable result...

The study and analysis of social graphs impacts on a wide range of applications, such as community decision making support and recommender systems. With the boom of online social networks, such analyses are benefiting from a massive collection and publication of social graphs at large scale. Unfortunately, individuals’ privacy right might be inadvertently violated when publishing this type of d...

A probabilistic semi-metric space (S, F ) is said to be of class H ([5]) if there exists a metric d on S such that, for t > 0, d(p, q) < t ⇔ Fpq(t) > 1− t. We will prove that (S, F ) is of class H iff the mapping K, defined on S × S by K (p, q) = sup{t ≥ 0 | t ≤ 1− Fpq(t)} is a metric on S. Two fixed point theorems for multivalued contractions in probabilistic metric spaces are also proved. Inc...