RT journal article
T1 Traversing a graph in general position
A1 Klavžar, Sandi
A1 Krishnakumar, Aditi
A1 Tuite, James
A1 González Yero, Ismael
A2 Matemáticas
K1 general position set
K1 mobile general position set
K1 mobile general position number
K1 robot navigation
K1 unicyclic graph
K1 Kneser graph
AB Let G be a graph. Assume that to each vertex of a set of vertices S subset of V(G) a robot is assigned. At each stage one robot can move to a neighbouring vertex. Then S is a mobile general position set of G if there exists a sequence of moves of the robots such that all the vertices of G are visited while maintaining the general position property at all times. The mobile general position number of G is the cardinality of a largest mobile general position set of G. We give bounds on the mobile general position number and determine exact values for certain common classes of graphs, including block graphs, rooted products, unicyclic graphs, Kneser graphs K(n, 2) and line graphs of complete graphs.
PB Cambrige Univ Press
SN 0004-9727
YR 2023
FD 2023-02-13
LK http://hdl.handle.net/10498/29596
UL http://hdl.handle.net/10498/29596
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 12-nov-2026