20.500.12556/DiRROS-24227 On 2-domination and 2-rainbow domination of cylindrical graphs Cylindrical graphs and torus grid graphs are naturally constructed from subgraphs of the infinite grid by certain identifications of boundary vertices. Considering various domination type problems, it is usually possible to find an optimal solution on the infinite grid. To the contrary, exact values of invariants for the cylindrical and torus grid graphs are typically only known for special subfamilies, and are in general hard to compute. The 2-domination and 2-rainbow domination of cylindrical graphs is studied, and some new formulae and improved bounds are reported. We also consider weak 2-domination and singleton rainbow domination. 2-domination weak 2-domination singleton 2-rainbow domination cylindrical graphs 2-dominacija šibka 2-dominacija singleton 2-mavrična dominacija cilindrični grafi true false true Springer Angleški jezik Ni določen © The Author(s) 2025 Neznano 2025-11-21 13:15:52 2025-11-21 13:22:40 2025-11-22 03:57:12 0000-00-00 00:00:00 2025 0 0 Nasl. z nasl. zaslona; Opis vira z dne 28. 5. 2025; 12 str. [article no.] 239 Vol. 44 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-04-16 51:621 1807-0302 10.1007/s40314-025-03201-2 237531395 https://link.springer.com/article/10.1007/s40314-025-03201-2 1 d56ed68d-c6d3-11f0-94a7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=36074 RAZ_Zerovnik_Janez_2025.pdf RAZ_Zerovnik_Janez_2025.pdf 1 2E48AFE7834294B5D46527D153E1B832 0015d70cacd6db56f92cfd52aea0feba20e521dc1782753b33ccc1031002bf5c 949b0850-c6d4-11f0-94a7-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=36075 Rudolfovo – Znanstveno in tehnološko središče Novo mesto 0 0 0