Upper bounds on the k-tuple (Roman) domination number of a graph

From MaRDI portal
Publication:2657089















This page was built for publication: Upper bounds on the \(k\)-tuple (Roman) domination number of a graph

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