Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs

From MaRDI portal
(Redirected from Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs)
Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs















This page was built for publication: Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs

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