Pages that link to "Item:Q2151499"

The following pages link to Further progress on the total Roman \(\{2\}\)-domination number of graphs (Q2151499):

Displaying 9 items.

• Open packing, total domination, and the \(P_3\)-Radon number (Q1947007) (← links)
• Total Roman \(\{2\}\)-reinforcement of graphs (Q2035667) (← links)
• Relating the total \(\{2\}\)-domination number with the total domination number of graphs (Q2700617) (← links)
• Some progress on the mixed roman domination in graphs (Q5002301) (← links)
• (Q6097717) (← links)
• Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
• Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles (Q6550939) (← links)
• Further results on the \([k]\)-Roman domination in graphs (Q6563288) (← links)
• An upper bound on the total Roman \(\{2\}\)-domination number of graphs with minimum degree two (Q6580152) (← links)