The following pages link to A new domination conception (Q4201388):
Displaying 22 items.
- Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
- Invariants concerning \(f\)-domination in graphs (Q472660) (← links)
- The \((j,k)\)-domatic number of a graph (Q656137) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Bounds on weak Roman and 2-rainbow domination numbers (Q741531) (← links)
- A polyhedral view to a generalization of multiple domination (Q832985) (← links)
- Topics on domination (Q1188929) (← links)
- The diversity of domination (Q1356420) (← links)
- Upper bounds for \(f\)-domination number of graphs (Q1584247) (← links)
- The many facets of upper domination (Q1704853) (← links)
- On \([j, k]\)-sets in graphs (Q2091155) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- Critical concepts in domination (Q2277481) (← links)
- On general frameworks and threshold functions for multiple domination (Q2352076) (← links)
- Algorithmic aspects of the \(k\)-domination problem in graphs (Q2446334) (← links)
- Restricted domination parameters in graphs (Q2467572) (← links)
- Some bounds on the \(p\)-domination number in trees (Q2501539) (← links)
- A bound on the k-domination number of a graph (Q3073450) (← links)
- Multiple Domination (Q3384609) (← links)
- An inner model for global domination (Q3616352) (← links)
- On $f$-domination number of a graph (Q4368817) (← links)
- Inequalities involving independence domination, f-domination, connected and total f-domination numbers (Q4814435) (← links)
