arXiv Analytics

Sign in

arXiv:1505.05811 [math.CO]AbstractReferencesReviewsResources

The Metric Dimension of The Tensor Product of Cliques

H. Amraei, H. R. Maimani, A. Seify, A. Zaeembashi

Published 2015-05-21Version 1

Let $G$ be a connected graph and $W=\{ w_1, w_2, \ldots, w_k \} \subseteq V(G)$ be an ordered set. For every vertex $v$, the metric representation of $v$ with respect to $W$ is an ordered $k$-vector defined as $r(v|W):=(d(v,w_1), d(v,w_2), \ldots, d(v,w_k))$, 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 respect to $W$. The minimum cardinality of a resolving set for $G$ is its metric dimension and is denoted by $dim(G)$. In this paper, we study the metric dimension of tensor product of cliques and prove some bounds. Then we determine the metric dimension of tensor product of two cliques.

Comments: 9 pages, no figure
Categories: math.CO
Subjects: 05C12, 05C69
Related articles: Most relevant | Search more
arXiv:2111.09095 [math.CO] (Published 2021-11-17, updated 2022-02-04)
Distance $k$-resolving domination number of graphs
arXiv:2208.01519 [math.CO] (Published 2022-08-02)
Metric Dimension of a Diagonal Family of Generalized Hamming Graphs
arXiv:1312.0191 [math.CO] (Published 2013-12-01, updated 2013-12-21)
Metric Dimension of Amalgamation of Graphs