Bounds on 2-point set domination number of a graph
From MaRDI portal
(Redirected from Publication:4603879)
Recommendations
Cites work
- Domination in graphoidal covers of a graph
- Finding a maximum independent set in a permutation graph
- Further results on domination in graphoidally covered graphs
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Independent domination in chordal graphs
- Minimal 2-point set dominating sets of a graph
- On approximating the minimum independent dominating set
- On point-set domination in graphs. II: Minimum psd-sets
- On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets
- Point-set domination number of a graph
- Set domination in graphs
- Some inequalities about connected domination number
Cited in
(11)- Independent 2-point set domination in graphs
- Point-set domination number of a graph
- On point-set domination in graphs. II: Minimum psd-sets
- Minimal 2-point set dominating sets of a graph
- 2-point set domination number of a cactus
- Global 2-point set domination number of a graph
- Characterizing minimal point set dominating sets
- Independent 2-point set domination in graphs - II
- Bounds of point-set domination number
- 2-Point set domination in separable graphs
- Independent 2-point set domination in graphs with specified girth
This page was built for publication: Bounds on 2-point set domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603879)