Pages that link to "Item:Q2118251"
From MaRDI portal
The following pages link to Roman \(\{2\}\)-domination problem in graphs (Q2118251):
Displaying 10 items.
- Roman \(\{2 \}\)-domination (Q266795) (← links)
- Difference between 2-rainbow domination and roman domination in graphs (Q1946223) (← links)
- Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number (Q2151206) (← links)
- Total Roman \(\{2\}\)-dominating functions in graphs (Q2151223) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- On 2-rainbow domination and roman domination in graphs (Q2848725) (← links)
- On the computational complexity of Roman\(\{2\}\)-domination in grid graphs (Q6043333) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)