The following pages link to Triple Roman domination in graphs (Q2661014):
Displaying 33 items.
- Roman domination problem with uncertain positioning and deployment costs (Q781325) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Defending the Roman Empire from multiple attacks (Q1408869) (← links)
- Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
- The domination number of round digraphs (Q2053549) (← links)
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle (Q2115152) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Global triple Roman dominating function (Q2127628) (← links)
- Further progress on the total Roman \(\{2\}\)-domination number of graphs (Q2151499) (← links)
- The signed edge-domatic number of nearly cubic graphs (Q2168740) (← links)
- Maximal double Roman domination in graphs (Q2247105) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- Properties of double Roman domination on cardinal products of graphs (Q4993967) (← links)
- (Q4996672) (← links)
- (Q5021092) (← links)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties (Q5074890) (← links)
- Total double Roman domination numbers in digraphs (Q5101908) (← 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 [<i>k</i>]-Roman domination subdivision number of graphs (Q6101473) (← links)
- (Q6149324) (← links)
- (Q6150942) (← links)
- (Q6155858) (← links)
- (Q6159868) (← links)
- New results on quadruple Roman domination in graphs (Q6174161) (← links)
- On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
- Further results on the \([k]\)-Roman domination in graphs (Q6563288) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two (Q6580152) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
- A characterization of graphs with global 3-rainbow domination number equal to the number of vertices (Q6654092) (← links)
- Complexity issues concerning the quadruple Roman domination problem in graphs (Q6658307) (← links)
