TY  - GEN 
AU  - González Yero, Ismael
AU  - Jakovac, Marko
AU  - Kuziak, Dorota
AU  - Taranenko, Andrej
A4  - Estadística e Investigación Operativa
A4  - Matemáticas
PY  - 2014
SN  - 0012-365X
UR  - http://hdl.handle.net/10498/30924
AB  - 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...
LA  - eng
PB  - Elsevier
KW  - Resolving partition
KW  - partition dimension
KW  - strong product graphs
KW  - Cartesian product graphs
KW  - graphs partitioning
TI  - The partition dimension of strong product graphs and Cartesian product graphs
DO  - 10.1016/j.disc.2014.04.026
ER  -