Pages that link to "Item:Q2410217"
From MaRDI portal
The following pages link to On the double Roman domination in graphs (Q2410217):
Displaying 50 items.
- Perfect double Roman domination of trees (Q777364) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Signed double Roman domination in graphs (Q1730213) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Double Roman domination number (Q1752604) (← links)
- Some progress on the restrained Roman domination (Q2021658) (← 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)
- A new approach on locally checkable problems (Q2127611) (← links)
- Outer independent signed double Roman domination (Q2142485) (← links)
- Double Roman domination in generalized Petersen graphs (Q2151479) (← 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 the independent double Roman domination in graphs (Q2196412) (← links)
- On the \(k\)-strong Roman domination problem (Q2197424) (← links)
- On algorithmic complexity of double Roman domination (Q2197468) (← links)
- Maximal double Roman domination in graphs (Q2247105) (← links)
- Outer independent double Roman domination (Q2284046) (← links)
- Algorithmic results on double Roman domination in graphs (Q2292130) (← 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)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- A note on the double Roman domination number of graphs (Q3297013) (← links)
- (Q3300702) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- (Q4622604) (← links)
- Double Roman domination and domatic numbers of graphs (Q4635028) (← links)
- Independent double Roman domination in graphs (Q4956191) (← links)
- Varieties of Roman domination II (Q4956207) (← links)
- Complexity of Roman {2}-domination and the double Roman domination in graphs (Q4956233) (← links)
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS (Q4956471) (← links)
- Bounds on signed total double Roman domination (Q4957530) (← links)
- Properties of double Roman domination on cardinal products of graphs (Q4993967) (← links)
- Global double Roman domination in graphs (Q5030493) (← links)
- Integer linear programming formulations for double roman domination problem (Q5038168) (← links)
- Signed double roman domination of graphs (Q5080285) (← links)
- Total double Roman domination in graphs (Q5212897) (← links)
- Signed total double Roman k-domination in graphs (Q5216448) (← 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)
- Double Roman reinforcement number in graphs (Q5861712) (← links)
- Double Roman domination subdivision number in graphs (Q5876741) (← links)
- An upper bound on the double Roman domination number (Q5895065) (← links)
- An upper bound on the double Roman domination number (Q5919141) (← links)
- Algorithmic aspects of certified domination in graphs (Q6101494) (← links)
- On the double Roman bondage numbers of graphs (Q6115753) (← links)
- Disprove of a conjecture on the double Roman domination number (Q6122419) (← links)
