A linear programming method for exponential domination

From MaRDI portal




Abstract: For a graph G, the set DsubseteqV(G) is a porous exponential dominating set if 1lesumdinDleft(2ight)1dist(d,v) for every vinV(G), where dist(d,v) denotes the length of the shortest dv path. The porous exponential dominating number of G, denoted gammae(G), is the minimum cardinality of a porous exponential dominating set. For any graph G, a technique is derived to determine a lower bound for gammae(G). Specifically for a grid graph H, 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 mathcalKn, the Slant Grid mathcalSn, and the n-dimensional hypercube Qn.











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)