2026-02-262026-02-262025COELHO, Erika Morais Martins; MORAES, Lauane Mateus Oliveira. Open-independent dominating sets in lexicographic product of graphs. Matemática Contemporânea, Rio de Janeiro, 2025. DOI: 10.1007/s44425-025-00034-3. Disponível em: https://link.springer.com/article/10.1007/s44425-025-00034-3. Acesso em: 18 fev. 2026.0103-9059e- 2317-6636https://link.springer.com/article/10.1007/s44425-025-00034-3An open-independent dominating set (OIND-set) S for a graph G is a set of vertices where no vertex in S has more than one neighbor within S, and every vertex in G is dominated by S. The minimum cardinality of an OIND-set is denoted by γoind(G). This work presents results concerning the γoind(G) of the lexicographic product G ◦ H. Specifically, we establish exact values under specific constraints on G, and provide bounds relative to another domination variant, as well as γoind(G) and γoind(H) .engAcesso RestritoDominating setOpen-independent dominating setLexicographic productArtigo10.1007/s44425-025-00034-3