Independent point-set dominating sets in graphs
From MaRDI portal
Recommendations
Cites work
- Characterization of graphs with equal domination numbers and independence numbers
- Characterizing minimal point set dominating sets
- Global 2-point set domination number of a graph
- Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs
- Graph theory
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 1247731 (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?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On point-set domination in graphs. II: Minimum psd-sets
- On point-set domination in graphs. IV: Separable graphs with unique minimum psd-sets
- On point-set domination in graphs. VI: Quest to characterise blocks containing independent PSD-sets
- Point-set domatic numbers of graphs
- Point-set domination in graphs. VIII: Perfect and efficient PSD sets
- Point-set domination number of a graph
- The Independence Ratio of Regular Graphs
Cited in
(4)
This page was built for publication: Independent point-set dominating sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154582)