Pages that link to "Item:Q2420413"

The following pages link to Total Roman domination in the lexicographic product of graphs (Q2420413):

Displaying 14 items.

• Double domination in lexicographic product graphs (Q777395) (← links)
• Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
• On the 2-packing differential of a graph (Q2044595) (← links)
• Note on the perfect Roman domination number of graphs (Q2284084) (← links)
• Total Roman domination edge-critical graphs (Q2292609) (← links)
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs (Q2307496) (← links)
• On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
• Varieties of Roman Domination (Q3384116) (← links)
• Closed formulas for the total Roman domination number of lexicographic product graphs (Q3390051) (← links)
• Total Roman {2}-domination in graphs (Q4986532) (← links)
• Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs (Q5075513) (← links)
• Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs (Q5139714) (← links)
• From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213) (← links)
• Total \(k\)-domination in Cartesian product of complete graphs (Q6162024) (← links)