Pages that link to "Item:Q5216452"

The following pages link to Bounds on the signed total Roman 2-domination in graphs (Q5216452):

Displaying 3 items.

• Complexity of signed total \(k\)-Roman domination problem in graphs (Q2131507) (← links)
• Clique doubly connected domination in the join and lexicographic product of graphs (Q5858176) (← links)
• New results on quadruple Roman domination in graphs (Q6174161) (← links)