Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:Moving through Cartesian products, coronas and joins in general position
Authors:ID Klavžar, Sandi (Author)
ID Krishnakumar, Aditi (Author)
ID Kuziak, Dorota (Author)
ID Shallcross, Ethan (Author)
ID Tuite, James (Author)
ID Yero, Ismael G. (Author)
Files:.pdf PDF - Presentation file, download (1,06 MB)
MD5: 693D19FABD15DC26BC90241E756B6087
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S0166218X25006183
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract: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.
Keywords:general position set, mobile general position set, mobile general position number, robot navigation, Cartesian product graph
Publication status:Published
Publication version:Version of Record
Publication date:01.01.2026
Year of publishing:2026
Number of pages:str. 768-780
Numbering:Vol. 379
PID:20.500.12556/DiRROS-23991 New window
UDC:519.17
ISSN on article:0166-218X
DOI:10.1016/j.dam.2025.10.041 New window
COBISS.SI-ID:255697155 New window
Note:
Publication date in DiRROS:04.11.2025
Views:204
Downloads:93
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete applied mathematics
Shortened title:Discrete appl. math.
Publisher:Elsevier
ISSN:0166-218X
COBISS.SI-ID:25342464 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0355
Name:Prirejanja, transverzale in hipergrafi

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0431
Name:Dominacija v grafih: kubični grafi, produkti in igre

Funder:Spanish Ministry of Science and Innovation
Project number:PID2023-146643NB-I00

Funder:Ministerio de Educación, Cultura y Deporte
Funding programme:‘‘José Castillejo’’ program for young researchers
Project number:CAS22/00081

Funder:The Open University
Funding programme:Crowther Fund

Funder:The Open University
Funding programme:Research bursary

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.

Secondary language

Language:Slovenian
Keywords:množica v splošni legi, mobilna množica v splošni legi, število mobilne splošne lege, navigacija robota, kartezični produkt grafov


Back