20.500.12556/RUL-185602 On singleton 3-rainbow domination of cylindrical graphs Domination is among the most popular topics in graph theory, both due to its combinatorial appeal and a number of practical applications. Cylindrical graphs are Cartesian products of a path and a cycle. Usually, for some special subfamilies, natural constructions exist that give exact solutions. On the other hand, in general, exact values of invariants on cylindrical graphs are hard to compute. In this paper, tight lower and upper bounds for singleton three-rainbow domination are proven and a subfamily of cylindrical graphs is found for which exact values are provided. The results complement recent findings for singleton two- and four-rainbow domination. graph theory singleton rainbow domination grid graphs cylindrical graphs teorija grafov mavrična dominacija mrežni grafi cilindrični grafi true false true Angleški jezik Slovenski jezik Članek v reviji 2026-08-12 11:45:02 2026-08-12 11:45:08 2026-08-13 04:00:39 0000-00-00 00:00:00 2026 0 0 13 str. no. 16, art. 2917 Vol. 14 2026 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 2227-7390 10.3390/math14162917 287586307 Zerovnik_..._On_singleton...pdf Zerovnik_..._On_singleton...pdf 1 3469B4A856BB898CB34B82E91BB85B2C a8915e60a6a3f32c6a5b2caf161529e71cfa77f9d1350e3ba839b8be220e4d45 79d471dc-9632-11f1-9b0d-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=244299 https://www.mdpi.com/2227-7390/14/16/2917 1 26db0fe6-9632-11f1-9b0d-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=244298 Fakulteta za strojništvo 0 0 0