New lower bounds on domination--packing ratios in connected subcubic and cubic graphs

JiSun Huh, Juho Kim

For a graph \(G\), let \(γ(G)\) and \(ρ(G)\) denote its domination number and packing number, respectively. Let \(c_{\mathrm{sub}}\) and \(c_{\mathrm{cub}}\) denote the respective…