Pages that link to "Item:Q1584247"

The following pages link to Upper bounds for \(f\)-domination number of graphs (Q1584247):

Displaying 16 items.

• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
• Upper bounds for the \(k\)-subdomination number of graphs (Q1598803) (← links)
• On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
• On the double Roman domination in graphs (Q2410217) (← links)
• Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
• A bound on the k-domination number of a graph (Q3073450) (← links)
• Varieties of Roman Domination (Q3384116) (← links)
• Multiple Domination (Q3384609) (← links)
• A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH (Q3677800) (← links)
• An upper bound on the domination number of a graph. (Q3812287) (← links)
• An upper bound for thek-domination number of a graph (Q3815347) (← links)
• A new domination conception (Q4201388) (← links)
• On $f$-domination number of a graph (Q4368817) (← links)
• (Q4681990) (← links)