Back to Search Start Over

TRAVERSING A GRAPH IN GENERAL POSITION.

Authors :
KLAVŽAR, SANDI
KRISHNAKUMAR, ADITI
TUITE, JAMES
YERO, ISMAEL G.
Source :
Bulletin of the Australian Mathematical Society. Dec2023, Vol. 108 Issue 3, p353-365. 13p.
Publication Year :
2023

Abstract

Let G be 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. 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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*COMPLETE graphs
*ROBOTS

Details

Language :
English
ISSN :
00049727
Volume :
108
Issue :
3
Database :
Academic Search Index
Journal :
Bulletin of the Australian Mathematical Society
Publication Type :
Academic Journal
Accession number :
173490755
Full Text :
https://doi.org/10.1017/S0004972723000102