TRAVERSING A GRAPH IN GENERAL POSITION
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 visit...
Gespeichert in:
Veröffentlicht in: | Bulletin of the Australian Mathematical Society 2023-12, Vol.108 (3), p.353-365 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 0004-9727 1755-1633 |
DOI: | 10.1017/S0004972723000102 |