Displaying similar documents to “Weak Total Resolvability In Graphs”

Closed Formulae for the Strong Metric Dimension of Lexicographi

Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez (2016)

Discussiones Mathematicae Graph Theory

Similarity:

Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. In this paper we obtain several relationships between the strong metric...

Computing the Metric Dimension of a Graph from Primary Subgraphs

Dorota Kuziak, Juan A. Rodríguez-Velázquez, Ismael G. Yero (2017)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . . , d(u, wk)), where d(u, wi) denotes the distance between u and wi. The set W is a metric generator for G if every two different vertices of G have distinct representations. A minimum cardinality metric generator is called a metric basis of G and its cardinality is called the metric dimension of...

On the strong metric dimension of the strong products of graphs

Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez (2015)

Open Mathematics

Similarity:

Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u. A set S of vertices is a strong resolving set for G if every pair of vertices of G is strongly resolved by some vertex of S. The smallest cardinality of a strong resolving set for G is called the strong metric dimension of G. It is well known that the problem of computing this invariant is NP-hard. In this...

The weak Phillips property

Ali Ülger (2001)

Colloquium Mathematicae

Similarity:

Let X be a Banach space. If the natural projection p:X*** → X* is sequentially weak*-weak continuous then the space X is said to have the weak Phillips property. We present several characterizations of the spaces having this property and study its relationships to other Banach space properties, especially the Grothendieck property.

Fixed point and multidimensional fixed point theorems with applications to nonlinear matrix equations in terms of weak altering distance functions

Kanokwan Sawangsup, Wutiphol Sintunavarat (2017)

Open Mathematics

Similarity:

The aim of this work is to introduce the notion of weak altering distance functions and prove new fixed point theorems in metric spaces endowed with a transitive binary relation by using weak altering distance functions. We give some examples which support our main results where previous results in literature are not applicable. Then the main results of the paper are applied to the multidimensional fixed point results. As an application, we apply our main results to study a nonlinear...