A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W . The metric dimension for G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In order to study the metric dimension for the hierarchical product G2 2 uG1 1 of two rooted graphs G2 2 and G u1 1 , we first introduce a new parameter, the rooted ...

in this paper, we propose a new definition of intuitionistic fuzzyquasi-metric and pseudo-metric spaces based on intuitionistic fuzzy points. weprove some properties of intuitionistic fuzzy quasi- metric and pseudo-metricspaces, and show that every intuitionistic fuzzy pseudo-metric space is intuitionisticfuzzy regular and intuitionistic fuzzy completely normal and henceintuitionistic fuzzy nor...

For a finite metric space V with a metric ρ, let V n be the metric space in which the distance between (a1, . . . , an) and (b1, . . . , bn) is the sum ∑n i=1 ρ(ai, bi). We obtain an asymptotic formula for the logarithm of the maximum possible number of points in V n of distance at least d from a set of half the points of V , when n tends to infinity and d satisfies d √ n. 1 The Main Results Le...

Let G be a connected graph. A vertex w strongly resolves a pair u, v of vertices of G if there exists some shortest u− w path containing v or some shortest v − w path containing u. A set W of vertices is a strong resolving set for G if every pair of vertices of G is strongly resolved by some vertex of W . The smallest cardinality of a strong resolving set for G is called the strong metric dimen...

In this paper, we study Einstein warped product space with respect to semi symmetric metric connection. During establish some results on curvature, Ricci and scalar tensors connection second order the last section, investigate under what conditions, if $M$ is an nonpositive curvature compact base then simply a Riemannian space.

Design-time use of software fault tree analysis allows designers to focus on safety critical system aspects early in the software development process. This paper presents a technique for evaluating the impact of software fault tree 'key nodes' requiring multiple inputs to fail before the hazard propagates through the system. A heuristics-based key node metric providing a design tool with which ...

For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W ) := (d(v, w1), d(v, w2), . . . , d(v, wk)) is called the (metric) representation of v with respect to W , where d(x, y) is the distance between the vertices x and y. The set W is called a resolving set for G if distinct vertices of G have distinct representations with respe...