Pages that link to "Item:Q2446857"
From MaRDI portal
The following pages link to Rainbow domination in the lexicographic product of graphs (Q2446857):
Displaying 25 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- The Cartesian product of cycles with small 2-rainbow domination number (Q498440) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- Double domination in lexicographic product graphs (Q777395) (← links)
- On \(k\)-rainbow domination in regular graphs (Q777421) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Independent Roman \(\{2 \}\)-domination in graphs (Q1693166) (← links)
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs (Q2008916) (← links)
- Domination related parameters in the generalized lexicographic product of graphs (Q2030248) (← links)
- Bounding the \(k\)-rainbow total domination number (Q2032845) (← links)
- On the 2-packing differential of a graph (Q2044595) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs (Q2408565) (← links)
- On the super domination number of lexicographic product graphs (Q2420416) (← links)
- On the weak Roman domination number of lexicographic product graphs (Q2420431) (← links)
- Independent rainbow domination of graphs (Q2421364) (← links)
- 2-rainbow domination number of \(C_n\square C_5\) (Q2449095) (← links)
- Rainbow Domination in Graphs (Q3384615) (← links)
- Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
- Partially composed property of generalized lexicographic product graphs (Q4597965) (← links)
- On the k-rainbow domination in graphs with bounded tree-width (Q5061680) (← links)
- Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs (Q5075513) (← links)
- A note on lower bounds for the total domination number of digraphs (Q5236092) (← links)
- From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)
- On the 2-rainbow independent domination numbers of some graphs (Q6166940) (← links)
