Stability of certified domination upon edge addition
From MaRDI portal
Cites work
- A linear algorithm for the domination number of a series-parallel graph
- Algorithmic aspects of certified domination in graphs
- Certified domination
- Domination in edge cycle graphs
- Domination in signed graphs
- Graphs with equal domination and certified domination numbers
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Notes on Latin square graphs and their domination numbers
- On domination number of Latin square graphs of finite cyclic groups
- On domination numbers of Cartesian products of paths
- On graphs having domination number half their order
- On the domination number of a graph and its block graph
- On the domination number of a graph and its shadow graph
- On the domination number of a graph and its total graph
- The domination number of grids
- The domination number of strong product of directed cycles
This page was built for publication: Stability of certified domination upon edge addition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983435)