A linear programming method for exponential domination
From MaRDI portal
Abstract: For a graph the set is a porous exponential dominating set if for every where denotes the length of the shortest path. The porous exponential dominating number of denoted is the minimum cardinality of a porous exponential dominating set. For any graph a technique is derived to determine a lower bound for Specifically for a grid graph linear programing is used to sharpen bound found through the lower bound technique. Lower and upper bounds are determined for the porous exponential domination number of the King Grid the Slant Grid and the -dimensional hypercube
Recommendations
Cites work
- Bounds on the exponential domination number
- Domination with exponential decay
- Exponential domination in subcubic graphs
- Hereditary equality of domination and exponential domination
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- On exponential domination of \(C_m\times C_n\)
- On exponential domination of some graphs
- Relating domination, exponential domination, and porous exponential domination
Cited in
(3)
This page was built for publication: A linear programming method for exponential domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4965263)