20.500.12556/RUL-170980 Roman domination of cartesian bundles of cycles over cycles A Roman dominating function f of a graph G=(V,E) assigns labels from the set {0,1,2} to vertices such that every vertex labeled 0 has a neighbor labeled 2. The weight of an RDF f is defined as w(f)=∑$_{v∈V}$f(v), and the Roman domination number, yR(G), is the minimum weight among all RDFs of G. This paper studies the domination and Roman domination numbers in Cartesian bundles of cycles. Furthermore, the constructed optimal patterns improve known bounds and suggest even better bounds might be achieved by combining patterns, especially for bundles involving shifts of order 4k and 5k. Roman domination domination graph bundles Roman graphs true false true Angleški jezik Ni določen Članek v reviji 2025-07-24 13:39:27 2025-07-24 13:39:30 2025-07-25 04:07:35 0000-00-00 00:00:00 2025 0 0 18 str. iss. 15, art. 2351 Vol. 13 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 2227-7390 10.3390/math13152351 243736579 Brezovnik_Zerovnik_Roman__Domination.pdf Brezovnik_Zerovnik_Roman__Domination.pdf 1 EEE4B5BC51106E281B1E66A8285A2516 94fefb2bf06eca94d0c5ccc2103a386aadf4f88a0fd888838e56e79b36c370a2 5389c48e-6883-11f0-9328-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=213288 https://www.mdpi.com/2227-7390/13/15/2351 1 d7a36c37-6882-11f0-9328-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=213287 Fakulteta za strojništvo 0 0 0