The following pages link to Double Roman domination in trees (Q1707975):
Displaying 38 items.
- Perfect double Roman domination of trees (Q777364) (← links)
- Signed double Roman domination in graphs (Q1730213) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Algorithm and hardness results in double Roman domination of graphs (Q2118874) (← links)
- Outer independent signed double Roman domination (Q2142485) (← links)
- Double Roman domination in generalized Petersen graphs (Q2151479) (← links)
- On the outer independent double Roman domination number (Q2169279) (← links)
- On the global double Roman domination of graphs (Q2186271) (← links)
- The double Roman domatic number of a digraph (Q2194527) (← links)
- Some properties of double Roman domination (Q2195491) (← links)
- On the independent double Roman domination in graphs (Q2196412) (← links)
- On algorithmic complexity of double Roman domination (Q2197468) (← links)
- Outer independent double Roman domination (Q2284046) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← links)
- Independent double Roman domination in graphs (Q2304392) (← links)
- Extremal digraphs for an upper bound on the double Roman domination number (Q2305613) (← links)
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two (Q2334052) (← links)
- On the double Roman domination of graphs (Q2335792) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- (Q4622604) (← links)
- Independent double Roman domination in graphs (Q4956191) (← links)
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS (Q4956471) (← links)
- Trees with vertex-edge roman domination number twice the domination number minus one (Q5018680) (← links)
- Global double Roman domination in graphs (Q5030493) (← links)
- Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
- Lower and upper bounds on independent double Roman domination in trees (Q5054041) (← links)
- Total double Roman domination in graphs (Q5212897) (← links)
- A linear algorithm for double Roman domination of proper interval graphs (Q5216450) (← links)
- Bounds for signed double Roman <i>k</i>-domination in trees (Q5242363) (← links)
- Critical concept for double Roman domination in graphs (Q5854749) (← links)
- An upper bound on the double Roman domination number (Q5895065) (← links)
- An upper bound on the double Roman domination number (Q5919141) (← links)
- Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
- Outer independent double Italian domination: Complexity, characterization (Q6132230) (← links)
- (Q6149323) (← links)
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) (Q6162014) (← links)