Pages that link to "Item:Q1630922"
From MaRDI portal
The following pages link to Some progress on the double Roman domination in graphs (Q1630922):
Displaying 24 items.
- Perfect double Roman domination of trees (Q777364) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle (Q2115152) (← links)
- Algorithm and hardness results in double Roman domination of graphs (Q2118874) (← links)
- On the outer independent double Roman domination number (Q2169279) (← links)
- On the global double Roman domination of graphs (Q2186271) (← links)
- Roman \(\{ 3 \}\)-domination (double Italian domination) (Q2192109) (← links)
- The double Roman domatic number of a digraph (Q2194527) (← links)
- On algorithmic complexity of double Roman domination (Q2197468) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (Q2334052) (← links)
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS (Q4956471) (← links)
- Total Roman domination for proper interval graphs (Q4958006) (← links)
- Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
- Total double Roman domination in graphs (Q5212897) (← links)
- An upper bound on the double Roman domination number (Q5919141) (← links)
- (Q6097712) (← links)
- On the double Roman bondage numbers of graphs (Q6115753) (← links)
- Outer independent double Italian domination: Complexity, characterization (Q6132230) (← links)
- (Q6149323) (← links)
- Inverse double Roman domination in graphs (Q6174775) (← links)
