Cost effective domination in the join, corona and composition of graphs
From MaRDI portal
Publication:5230847
Recommendations
- On k-cost effective domination in the corona and lexicographic product of graphs and its variant
- Cost effective domination in graphs
- Bounds on cost effective domination numbers
- Domination in the corona and join of graphs
- On connected co-independent domination in the join, corona and lexicographic product of graphs
Cites work
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- A sufficient condition for dominating cycles
- Bounds on cost effective domination numbers
- Cost effective domination in graphs
- Domination in the corona and join of graphs
- On maximum number of minimal dominating sets in graphs
- On minimal geodetic domination in graphs
- Towards a theory of domination in graphs
Cited in
(7)- On k-cost effective domination in the corona and lexicographic product of graphs and its variant
- Cost effective domination in graphs
- scientific article; zbMATH DE number 6999751 (Why is no real title available?)
- Bounds on cost effective domination numbers
- Forcing domination numbers of graphs under some binary operations
- Alliances and Related Domination Parameters
- Client-server and cost effective sets in graphs
This page was built for publication: Cost effective domination in the join, corona and composition of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230847)