RT journal article
T1 Moving through Cartesian products, coronas and joins in general position
A1 Klavžar, Sandi
A1 Krishnakumar, Aditi
A1 Kuziak, Dorota
A1 Shallcross, Ethan
A1 Tuite, James
A1 González Yero, Ismael
A2 Estadística e Investigación Operativa
A2 Matemáticas
K1 General position set
K1 Mobile general position set
K1 Mobile general position number
K1 Robot navigation
K1 Cartesian product graph
AB The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was defined, called the mobile general position problem , in which a collection of robots must visit all the vertices of the graph whilst remaining in general position. In this paper we investigate this problem in the context of Cartesian products, corona products and joins, giving upper and lower bounds for general graphs and exact values for families including grids, cylinders, Hamming graphs and prisms of trees.
PB Elsevier
SN 0166-218X
YR 2026
FD 2026-10
LK http://hdl.handle.net/10498/39075
UL http://hdl.handle.net/10498/39075
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 09-may-2026