Characterizing minimal point set dominating sets
From MaRDI portal
Publication:504160
Recommendations
Cites Work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4104992 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A direct inductive proof of a conjecture due to E. Sampathkumar and L. Pushpa Latha on the weak domination number of a tree
- Hereditary properties of raphs
- 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
Cited In (8)
- Minimal 2-point set dominating sets of a graph
- On point-set domination in graphs. II: Minimum psd-sets
- Independent point-set dominating sets in graphs
- Bounds on 2-point set domination number of a graph
- Bounds of point-set domination number
- 2-Point set domination in separable graphs
- Point set tree domination in graphs
- Point-set domination number of a graph
This page was built for publication: Characterizing minimal point set dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504160)