20.500.12556/DiRROS-18486 Orientable domination in product-like graphs The orientable domination number, ${\rm DOM}(G)$, of a graph $G$ is the largest domination number over all orientations of $G$. In this paper, ${\rm DOM}$ is studied on different product graphs and related graph operations. The orientable domination number of arbitrary corona products is determined, while sharp lower and upper bounds are proved for Cartesian and lexicographic products. A result of Chartrand et al. from 1996 is extended by establishing the values of ${\rm DOM}(K_{n_1,n_2,n_3})$ for arbitrary positive integers $n_1,n_2$ and $n_3$. While considering the orientable domination number of lexicographic product graphs, we answer in the negative a question concerning domination and packing numbers in acyclic digraphs posed in [Domination in digraphs and their direct and Cartesian products, J. Graph Theory 99 (2022) 359-377]. digraph domination orientable domination number packing graph product corona graph usmerjeni graf dominacija orientabilno dominantno število pakiranje grafovski produkt korona true false true Angleški jezik Slovenski jezik Neznano 2024-03-20 11:01:58 2024-03-20 11:01:58 2024-03-21 03:35:37 0000-00-00 00:00:00 2023 0 0 str. 62-69 Vol. 326 Feb. 2023 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2023-02-01 519.17 0166-218X 10.1016/j.dam.2022.11.003 135012355 1-s2.0-S0166218X22004267-main.pdf 1-s2.0-S0166218X22004267-main.pdf 1 75412643A755D775B048FFDBDD0F94D4 afe50ceb7ae937e1a08bdedcebec9348889efc1892144973a315ef915de56f14 42f067cc-e6a1-11ee-9dd4-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25191 https://www.sciencedirect.com/science/article/pii/S0166218X22004267 1 e5367ed1-e6a0-11ee-9dd4-001a4af901a5 https://dirros.openscience.si/Dokument.php?lang=slv&id=25190 Inštitut za matematiko, fiziko in mehaniko 0 0 0