Sep 6, 2015 · In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the ...

In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric ...

Jun 26, 2015 · Abstract. A vertex w of a connected graph G strongly resolves two vertices u, v ∈ V (G), if there exists some shortest u−w path containing v ...

Sep 6, 2015 · In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the ...

Sep 6, 2015 · In this paper, we have studied the domination number and the metric dimension of the co-normal product of graphs. ... ... A graph having n ...

Semantic Scholar extracted view of "On the strong metric dimension of Cartesian and direct products of graphs" by J. A. Rodríguez-Velázquez et al.

In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric ...

In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric ...

The Cartesian sum is also known as the disjunctive product [22]. Notice that the Cartesian product, the strong product and the Cartesian sum of graphs are ...

It is known that the problem of computing the strong metric dimension of a graph is NP-hard. In this paper we obtain closed formulae for the strong metric ...