20.500.12556/DiRROS-23991 Moving through Cartesian products, coronas and joins in general position The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was defined, called the mobile general position problem, in which a collection of robots must visit all the vertices of the graph whilst remaining in general position. In this paper we investigate this problem in the context of Cartesian products, corona products and joins, giving upper and lower bounds for general graphs and exact values for families including grids, cylinders, Hamming graphs and prisms of trees. general position set mobile general position set mobile general position number robot navigation Cartesian product graph množica v splošni legi mobilna množica v splošni legi število mobilne splošne lege navigacija robota kartezični produkt grafov true false true Angleški jezik Slovenski jezik Neznano 2025-11-04 08:24:57 2025-11-04 08:24:57 2025-11-05 03:39:51 0000-00-00 00:00:00 2026 0 0 str. 768-780 Vol. 379 Jan. 2026 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2026-01-01 519.17 0166-218X 10.1016/j.dam.2025.10.041 255697155 1-s2.0-S0166218X25006183-main.pdf 1-s2.0-S0166218X25006183-main.pdf 1 693D19FABD15DC26BC90241E756B6087 534ecdd71f22cac660bdef1b6baee1df51548159d6794c5a36c9f5b80cbb3f8c ba4a1a56-b94f-11f0-9bb7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=35634 https://www.sciencedirect.com/science/article/pii/S0166218X25006183 1 5f6bcb1c-b94f-11f0-9bb7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=35633 Inštitut za matematiko, fiziko in mehaniko 0 0 0