Abstract
AbstractLetGbe a graph. Assume that to each vertex of a set of vertices$S\subseteq V(G)$a robot is assigned. At each stage one robot can move to a neighbouring vertex. ThenSis a mobile general position set ofGif there exists a sequence of moves of the robots such that all the vertices ofGare visited while maintaining the general position property at all times. The mobile general position number ofGis the cardinality of a largest mobile general position set ofG. 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
Cambridge University Press (CUP)
Reference15 articles.
1. [14] Website Starship, https://www.starship.xyz/ (accessed on 22 September 2022).
2. On the general position number of two classes of graphs
3. Complete visibility for mobile robots with lights tolerating faults;Aljohani;Int. J. Netw. Comput.,2018
4. The general position problem on Kneser graphs and on some graph operations
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献