Pages that link to "Item:Q5259399"

The following pages link to Roman domination in Cartesian product graphs and strong product graphs (Q5259399):

Displaying 19 items.

• Perfect double Roman domination of trees (Q777364) (← links)
• Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
• Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
• Perfect Italian domination in trees (Q1741510) (← links)
• The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
• Total Roman reinforcement in graphs (Q2312053) (← links)
• Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
• Bondage number of grid graphs (Q2440103) (← links)
• On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
• Roman domination in direct product graphs and rooted product graphs (Q2671126) (← links)
• Roman Domination in Graphs (Q3384614) (← links)
• Independent Roman domination and 2-independence in trees (Q4577859) (← links)
• Mixed Roman domination and 2-independence in trees (Q4583517) (← links)
• On the roman domination number of generalized Sierpiński graphs (Q5023115) (← links)
• Global double Roman domination in graphs (Q5030493) (← links)
• Results on Total Restrained Domination number and subdivision number for certain graphs (Q5069711) (← links)
• A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers (Q5242940) (← links)
• Domination-related parameters in rooted product graphs (Q5964910) (← links)
• Roman domination and independent Roman domination on graphs with maximum degree three (Q6124437) (← links)