Pages that link to "Item:Q2284046"

The following pages link to Outer independent double Roman domination (Q2284046):

Displaying 28 items.

• Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
• Some progress on the restrained Roman domination (Q2021658) (← links)
• Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
• The domination number of round digraphs (Q2053549) (← 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)
• A new approach on locally checkable problems (Q2127611) (← links)
• Further progress on the total Roman \(\{2\}\)-domination number of graphs (Q2151499) (← links)
• Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
• On the outer independent double Roman domination number (Q2169279) (← links)
• Maximal double Roman domination in graphs (Q2247105) (← links)
• Triple Roman domination in graphs (Q2661014) (← links)
• Perfect Italian domination in cographs (Q2661056) (← links)
• Varieties of Roman domination II (Q4956207) (← links)
• (Q4957549) (← links)
• On the outer-independent double Italian domination number (Q5054034) (← links)
• The total co-independent domination number of some graph operations (Q5101866) (← links)
• Total double Roman domination numbers in digraphs (Q5101908) (← links)
• Total k-rainbow reinforcement number in graphs (Q5859516) (← links)
• Quadruple Roman domination in graphs (Q5866033) (← links)
• On the outer independent total double Roman domination in graphs (Q6042155) (← links)
• Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
• Disprove of a conjecture on the double Roman domination number (Q6122419) (← links)
• (Q6149323) (← links)
• New results on quadruple Roman domination in graphs (Q6174161) (← links)
• On \(d\)-stable locally checkable problems parameterized by mim-width (Q6202932) (← links)
• The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
• Outer-independent Roman domination on Cartesian product of paths (Q6671977) (← links)