Relating domination, exponential domination, and porous exponential domination

DOI10.1016/j.disopt.2016.12.002zbMath1387.90136arXiv1605.04575OpenAlexW2963429841WikidataQ115577215 ScholiaQ115577215MaRDI QIDQ1751208

Michael A. Henning, Simon Jäger, Dieter Rautenbach

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.04575

zbMATH Keywords

dominationlinear programming relaxationexponential dominationporous exponential domination

Mathematics Subject Classification ID

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

Related Items (7)

Porous exponential domination number of some graphs ⋮ Porous exponential domination in Harary graphs ⋮ Exponential independence in subcubic graphs ⋮ A vulnerability parameter of networks ⋮ A linear programming method for exponential domination ⋮ On \(k\)-rainbow independent domination in graphs ⋮ Linear programming approach for various domination parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponential domination in subcubic graphs
• On exponential domination of \(C_m\times C_n\)
• Bounds on the exponential domination number
• Domination with exponential decay
• Domination versus disjunctive domination in trees
• Unsolved algorithmic problems on trees
• The disjunctive domination number of a graph
• Algorithmic Aspects of Disjunctive Domination in Graphs
• Domination versus disjunctive domination in graphs

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