20.500.12556/RUL-148033 On the 2-rainbow independent domination numbers of some graphs By suitably adjusting the tropical algebra technique we compute the rainbow independent domination numbers of several infinite families of graphs including Cartesian products $C_n \Box P_m$ and $C_n \Box C_m$ for all $n$ and $m\le 5$, and generalized Petersen graphs $P(n,2)$ for $n \ge 3$. graph theory rainbow independent domination number path algebra tropical algebra teorija grafov mavrično neodvisno dominacijsko število algebra poti tropska algebra true false true Angleški jezik Slovenski jezik Članek v reviji 2023-07-26 10:02:57 2023-07-26 10:03:00 2024-09-30 13:36:37 0000-00-00 00:00:00 2023 0 0 Str. 817-831 iss. 3 Vol. 31 Sep. 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 1435-246X 10.1007/s10100-023-00840-w 142159107 s10100-023-00840-w.pdf s10100-023-00840-w.pdf 1 23E8B2E5ECAAA46DF855790A43423D88 4aa039a7545ba83e5e5d013683b46ea3b6678facf0041549ba6c50f30e4ce9bc 4c036780-2b8b-11ee-aeaf-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=171963 https://link.springer.com/article/10.1007/s10100-023-00840-w 1 f08aa08b-2b8a-11ee-aeaf-00155dcfd717 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=171962 Fakulteta za strojništvo Fakulteta za matematiko in fiziko 0 0 0