On the strong partition dimension of graphs

Abstract

We present a new style of metric generator in graphs. Specifically we introduce a metric generator based on a partition of the vertex set of a graph. The sets of the partition will work as the elements which will uniquely determine the position of each single vertex of the graph. A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either dG(x, W) = dG(x, y) + dG(y, W) or dG(y, W) = dG(y, x) + dG(x, W), where dG(x, W) = min {d(x, w): w ∈ W}. An ordered vertex partition Π = {U1, U2,..., Uk} of a graph G is a strong resolving partition for G if every two different vertices of G belonging to the same set of the partition are strongly resolved by some set of Π. A strong resolving partition of minimum cardinality is called a strong partition basis and its cardinality the strong partition dimension. In this article we introduce the concepts of strong resolving partition and strong partition dimension and we begin with the study of its mathematical properties.