Pages that link to "Item:Q3177476"

The following pages link to Outer independent Roman dominating functions in graphs (Q3177476):

Displaying 23 items.

• Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination (Q2025071) (← links)
• The domination number of round digraphs (Q2053549) (← links)
• Restrained condition on double Roman dominating functions (Q2096308) (← links)
• Relating the outer-independent total Roman domination number with some classical parameters of graphs (Q2141037) (← links)
• Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
• On the outer independent double Roman domination number (Q2169279) (← links)
• A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
• Covering Italian domination in graphs (Q2231776) (← links)
• Weakly connected Roman domination in graphs (Q2322879) (← links)
• Outer-independent total Roman domination in graphs (Q2328098) (← links)
• Independent Roman domination and 2-independence in trees (Q4577859) (← links)
• Varieties of Roman domination II (Q4956207) (← links)
• (Q4957549) (← links)
• Outer independent Roman domination number of trees (Q4957568) (← links)
• The total co-independent domination number of some graph operations (Q5101866) (← links)
• Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
• On trees with equal Roman domination and outer-independent Roman domination numbers (Q5242949) (← links)
• Total k-rainbow reinforcement number in graphs (Q5859516) (← links)
• On the outer independent total double Roman domination in graphs (Q6042155) (← links)
• Unique response Roman domination: complexity and algorithms (Q6088304) (← links)
• On maximal Roman domination in graphs: complexity and algorithms (Q6593946) (← links)
• On the total version of the covering Italian domination problem (Q6611080) (← links)
• Outer-independent Roman domination on Cartesian product of paths (Q6671977) (← links)