The Metric Dimension of The Tensor Product of Cliques
Abstract
Let G be a connected graph and W=\ w1, w2, …, wk \ ⊂eq 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,w1), d(v,w2), …, d(v,wk)), 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.