The following pages link to Varieties of Roman Domination (Q3384116):
Displaying 42 items.
- Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
- Restrained Roman and restrained Italian domatic numbers of graphs (Q2081477) (← links)
- Computing strong Roman domination of trees and unicyclic graphs in linear time (Q2082401) (← links)
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle (Q2115152) (← links)
- On the Italian reinforcement number of a digraph (Q2133372) (← links)
- Outer independent signed double Roman domination (Q2142485) (← links)
- The Roman domatic problem in graphs and digraphs: a survey (Q2151218) (← links)
- A new upper bound for the perfect Italian domination number of a tree (Q2151228) (← links)
- Further progress on the total Roman \(\{2\}\)-domination number of graphs (Q2151499) (← links)
- Outer independent Roman domination number of trees (Q4957568) (← links)
- On the outer-independent double Italian domination number (Q5054034) (← links)
- Graphs whose weak Roman domination number increases by the deletion of any edge (Q5101896) (← links)
- On the total Roman domination stability in graphs (Q5861706) (← links)
- Double Roman reinforcement number in graphs (Q5861712) (← links)
- Quadruple Roman domination in graphs (Q5866033) (← links)
- Double Roman domination subdivision number in graphs (Q5876741) (← links)
- On the outer independent total double Roman domination in graphs (Q6042155) (← links)
- Total Italian domatic number of graphs (Q6074037) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
- (Q6097712) (← links)
- On the Zagreb indices of graphs with given Roman domination number (Q6097714) (← links)
- (Q6097717) (← links)
- Disprove of a conjecture on the double Roman domination number (Q6122419) (← links)
- Roman domination and independent Roman domination on graphs with maximum degree three (Q6124437) (← links)
- (Q6149321) (← links)
- (Q6149324) (← links)
- (Q6149330) (← links)
- (Q6150904) (← links)
- (Q6155856) (← links)
- (Q6159868) (← links)
- New results on quadruple Roman domination in graphs (Q6174161) (← links)
- (Q6191374) (← links)
- Outer independent total double Italian domination number (Q6546350) (← links)
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles (Q6550939) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- On maximal Roman domination in graphs: complexity and algorithms (Q6593946) (← links)
- New bounds on the outer-independent total double Roman domination number (Q6637043) (← links)
- Weak double Roman domination (Q6639835) (← links)
- Quasi total double Roman domination in graphs (Q6643350) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
- Domination parameters of generalized Sierpiński graphs (Q6651148) (← links)
- Complexity issues concerning the quadruple Roman domination problem in graphs (Q6658307) (← links)
