RT journal article
T1 Resolvability and strong resolvability in the direct product of graphs
A1 Kuziak, Dorota
A1 Peterin, Iztok
A1 González Yero, Ismael
A2 Estadística e Investigación Operativa
A2 Matemáticas
K1 Metric dimension
K1 strong metric dimension
K1 direct product of graphs
K1 strong resolving graph
AB Given a connected graph $G$, a vertex $w\in V(G)$ distinguishes two different vertices $u,v$ of $G$if the distances between $w$ and $u$, and between $w$ and $v$ are different. Moreover, $w$ strongly resolves the pair $u,v$if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$.A set $W$ of vertices is a (strong) metric generator for $G$ if every pair of vertices of $G$ is(strongly resolved) distinguished by some vertex of $W$. The smallest cardinality of a (strong) metricgenerator for $G$ is called the (strong) metric dimension of $G$. In this article we study the (strong)metric dimension of some families of direct product graphs.
PB Springer
SN 1420-9012
YR 2017
FD 2017-02
LK http://hdl.handle.net/10498/30888
UL http://hdl.handle.net/10498/30888
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026