A note on the partition dimension of Cartesian product graphs

Abstract

Let $G=(V,E)$ be a connected graph. The distance between two vertices $u,v\in V$, denoted by $d(u,v)$, is the length of a shortest $u-v$ path in $G$. The distance between a vertex $v\in V$ and a subset $P\subset V$ is defined as $min\{d(v,x):x\in P\}$, and it is denoted by $d(v,P)$. An ordered partition $\{P_1,P_2,...,P_t\}$ of vertices of a graph $G$, is a \emph{resolving partition}of $G$, if all the distance vectors $(d(v,P_1),d(v,P_2),...,d(v,P_t))$ are different. The \emph{partition dimension} of $G$, denoted by $pd(G)$, is the minimum number of sets in any resolving partition of $G$. In this article we study the partition dimension of Cartesian product graphs. More precisely, we show that for all pairs of connected graphs $G,H$, $pd(G\times H)\le pd(G)+pd(H)$ and $pd(G\times H)\le pd(G)+dim(H).$ Consequently, we show that $pd(G\times H)\le dim(G)+dim(H)+1.$

Cited by in corpus (11)

• On the metric dimension of corona product graphs
• The k-metric dimension of a graph
• On the partition dimension of trees
• On the partition dimension of unicyclic graphs
• Metric dimension related parameters in graphs: A survey on combinatorial, computational and applied results
• On Sharp Bounds of Local Fractional Metric Dimension for Certain Symmetrical Algebraic Structure Graphs
• On the Partition Dimension and the Twin Number of a Graph
• On the strong metric dimension of Cartesian and direct products of graphs
• A note on $k$-metric dimensional graphs
• Alliance free sets in Cartesian product graphs
• On the strong partition dimension of graphs