On the complexity of global Roman domination problem in graphs
From MaRDI portal
This page was built for publication: On the complexity of global Roman domination problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7212712)