20.500.12556/DKUM-89847 Mutual-visibility sets in cartesian products of paths and cycles For 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. mutual-visibility set supermutual-visibility number Cartesian product matematični grafi teorija grafov true false true Springer Link; Birkhäuser Angleški jezik Slovenski jezik https://link.springer.com/journal/25 2024 The Author(s) Članek v reviji 2024-08-14 11:12:05 2024-08-14 11:12:06 2025-07-23 03:11:04 0000-00-00 00:00:00 2024 0 0 20 str. št. članka 116 let. 79 9. marec 2024 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2023-08-30 2024-01-21 2024-03-09 519.7 188475651 10.1007/s00025-024-02139-x 1422-6383 s00025-024-02139-x.pdf s00025-024-02139-x.pdf 1 6696E5F9B93C9E7DD6BFC20CA0B8B0E1 49bb1f50d99aa6749bde8f2c4c95a5707095acf256f2f85d3ee4efe78bdac606 f9b09af9-66e9-11f0-b4a7-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=193938 https://link.springer.com/article/10.1007/s00025-024-02139-x 0 0018e409-66ea-11f0-b4a7-00155d000105 https://dk.um.si/Dokument.php?lang=slv&id=193939 Fakulteta za elektrotehniko, računalništvo in informatiko 0 0 0