Pages that link to "Item:Q1584247"
From MaRDI portal
The following pages link to Upper bounds for \(f\)-domination number of graphs (Q1584247):
Displaying 8 items.
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← 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)
