The following pages link to Double Roman domination (Q335328):
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)
- Some progress on the double Roman domination in graphs (Q1630922) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)
- Double Roman domination in trees (Q1707975) (← links)
- On the co-Roman domination in graphs (Q1717198) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- Signed double Roman domination in graphs (Q1730213) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- Double Roman domination number (Q1752604) (← links)
- Restrained condition on double Roman dominating functions (Q2096308) (← 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)
- Global triple Roman dominating function (Q2127628) (← links)
- Outer independent signed double Roman domination (Q2142485) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- Total protection of lexicographic product graphs (Q2151225) (← links)
- Double Roman domination in generalized Petersen graphs (Q2151479) (← links)
- Bounds on the double Italian domination number of a graph (Q2158195) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← 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)
- 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)
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) (Q2239024) (← links)
- Maximal double Roman domination in graphs (Q2247105) (← links)
- Double Roman domination in digraphs (Q2272602) (← 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)
- Perfect Roman domination in graphs (Q2333784) (← 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)
- On the double Roman domination in graphs (Q2410217) (← links)
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph (Q2657089) (← links)
- Triple Roman domination in graphs (Q2661014) (← links)
- Perfect Italian domination in cographs (Q2661056) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- The restrained double Roman domination in graphs (Q2683144) (← links)
- Outer independent Roman dominating functions in graphs (Q3177476) (← links)
- A note on the double Roman domination number of graphs (Q3297013) (← links)
- (Q3300702) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- (Q4622604) (← links)
