2-rainbow independent domination in complementary prismsBožović, Dragana (Avtor) Radić, Gordana (Avtor) Tepeh, Aleksandra (Avtor) graph theorydomination2-rainbow independent dominationcomplementary prismA function f that assigns values from the set to each vertex of a graph G is called a 2-rainbow independent dominating function, if the vertices assigned the value 1 form an independent set, the vertices assigned the value 2 form another independent set, and every vertex to which 0 is assigned has at least one neighbor in each of the mentioned independent sets. The weight of this function is the total number of vertices assigned nonzero values. The 2-rainbow independent domination number of G, , is the minimum weight of such a function. Motivated by a real-life application, we study the 2-rainbow independent domination number of the complementary prism of a graph G, which is constructed by taking G and its complement , and then adding edges between corresponding vertices. We provide tight bounds for , and characterize graphs for which the lower bound, i.e. , is attained. The obtained results can, in practice, enable the prediction of the cost estimate for a given communication or surveillance network.Sociedade Brasileira de Matemática Aplicada e Computacional (SBMAC) = Brazilian Society of Computational and Applied Mathematics (Springer)20252025-04-23 15:38:58Članek v reviji92600UDK: 519.17COBISS_ID: 233075971DOI: 10.1007/s40314-025-03189-9ISSN pri članku: 1807-0302sl© The Author(s) 2025