Rainbow domination in the lexicographic product of graphs

From MaRDI portal
Publication:2446857

DOI10.1016/j.dam.2013.03.011zbMath1286.05146arXiv1210.0514OpenAlexW2092368006MaRDI QIDQ2446857

Douglas F. Rall, Tadeja Kraner Šumenjak, Aleksandra Tepeh Horvat

Publication date: 22 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.0514




Related Items (25)

Roman \(\{2 \}\)-dominationOn the k-rainbow domination in graphs with bounded tree-widthPerfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product GraphsThe 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphsDomination parameters with number 2: interrelations and algorithmic consequencesOn the super domination number of lexicographic product graphsOn the weak Roman domination number of lexicographic product graphsIndependent rainbow domination of graphsFrom \(w\)-domination in graphs to domination parameters in lexicographic product graphsIndependent Roman \(\{2 \}\)-domination in graphsPartially composed property of generalized lexicographic product graphsOn the 2-rainbow independent domination numbers of some graphs2-rainbow domination number of \(C_n\square C_5\)The Cartesian product of cycles with small 2-rainbow domination numberComplexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphsDomination related parameters in the generalized lexicographic product of graphsBounding the \(k\)-rainbow total domination numberOn the 2-packing differential of a graphBounds on weak Roman and 2-rainbow domination numbersRainbow Domination in GraphsClosed formulas for the total Roman domination number of lexicographic product graphsProtection of lexicographic product graphsA note on lower bounds for the total domination number of digraphsDouble domination in lexicographic product graphsOn \(k\)-rainbow domination in regular graphs



Cites Work




This page was built for publication: Rainbow domination in the lexicographic product of graphs