Pages that link to "Item:Q2444571"

The following pages link to On upper bounds for multiple domination numbers of graphs (Q2444571):

Displaying 10 items.

• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
• Simultaneous domination in graphs (Q489305) (← links)
• A polyhedral view to a generalization of multiple domination (Q832985) (← links)
• Constructing dominating sets in circulant graphs (Q1745909) (← links)
• Combinatorial bounds on paired and multiple domination in triangulations (Q1792065) (← links)
• Randomized algorithms and upper bounds for multiple domination in graphs and networks (Q1941386) (← links)
• A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities (Q2104984) (← links)
• On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
• (Q3201105) (← links)
• Multiple Domination (Q3384609) (← links)