Relating domination, exponential domination, and porous exponential domination

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Integer programming (90C10) Programming involving graphs or networks (90C35)

Abstract: The domination number

g a m m a (G)

of a graph

G

, its exponential domination number

g a m m a_{e} (G)

, and its porous exponential domination number

g a m m a_{e}^{*} (G)

satisfy

g a m m a_{e}^{*} (G) l e q g a m m a_{e} (G) l e q g a m m a (G)

. We contribute results about the gaps in these inequalities as well as the graphs for which some of the inequalities hold with equality. Relaxing the natural integer linear program whose optimum value is

g a m m a_{e}^{*} (G)

, we are led to the definition of the fractional porous exponential domination number

g a m m a_{e, f}^{*} (G)

of a graph

G

. For a subcubic tree

T

of order

n

, we show

g a m m a_{e, f}^{*} (T) = f r a c n + 2 6

and

g a m m a_{e} (T) l e q 2 g a m m a_{e, f}^{*} (T)

. We characterize the two classes of subcubic trees

T

with

g a m m a_{e} (T) = g a m m a_{e, f}^{*} (T)

and

g a m m a (T) = g a m m a_{e} (T)

, respectively. Using linear programming arguments, we establish several lower bounds on the fractional porous exponential domination number in more general settings.

Recommendations

Cites work

Cited in

(10)

This page was built for publication: Relating domination, exponential domination, and porous exponential domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751208)