@misc{10498/29596,
year = {2023},
month = {2},
url = {http://hdl.handle.net/10498/29596},
abstract = {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.},
publisher = {Cambrige Univ Press},
keywords = {general position set},
keywords = {mobile general position set},
keywords = {mobile general position number},
keywords = {robot navigation},
keywords = {unicyclic graph},
keywords = {Kneser graph},
title = {Traversing a graph in general position},
doi = {10.1017/S0004972723000102},
author = {Klavžar, Sandi and Krishnakumar, Aditi and Tuite, James and González Yero, Ismael},
}