Mutual-visibility sets in cartesian products of paths and cyclesKorže, Danilo (Avtor) Vesel, Aleksander (Avtor) mutual-visibility setsupermutual-visibility numberCartesian productFor a given graph G, the mutual-visibility problem asks for the largest set of vertices M ⊆ V (G) with the property that for any pair of vertices u, v ∈ M there exists a shortest u, v-path of G that does not pass through any other vertex in M. The mutual-visibility problem for Cartesian products of a cycle and a path, as well as for Cartesian products of two cycles, is considered. Optimal solutions are provided for the majority of Cartesian products of a cycle and a path, while for the other family of graphs, the problem is completely solved.Springer Link; Birkhäuser20242024-08-14 11:12:05Članek v reviji89847UDK: 519.7COBISS_ID: 188475651DOI: 10.1007/s00025-024-02139-xISSN pri članku: 1422-6383sl2024 The Author(s)