New results on quadruple Roman domination in graphs
From MaRDI portal
Publication:6174161
Nordhaus-Gaddum boundquadruple Roman domination\([k\)-Roman domination]
Recommendations
Cites work
- scientific article; zbMATH DE number 7362655 (Why is no real title available?)
- scientific article; zbMATH DE number 6769213 (Why is no real title available?)
- scientific article; zbMATH DE number 7693187 (Why is no real title available?)
- Algorithmic aspects of outer independent Roman domination in graphs
- Algorithmic aspects of total Roman ${2}$-domination in graphs
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- Bounds on the signed total Roman 2-domination in graphs
- Double Roman domination
- Double Roman domination and domatic numbers of graphs
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Graphs whose weak Roman domination number increases by the deletion of any edge
- Isolate Roman domination in graphs
- Maximal double Roman domination in graphs
- Outer independent double Roman domination
- Quadruple Roman domination in graphs
- Resolving Roman domination in graphs
- Roman domination in graphs
- Roman domination in graphs.
- The double Roman domination number of generalized Sierpiński graphs
- Total double Roman domination in graphs
- Triple Roman domination in graphs
- Varieties of Roman Domination
- Varieties of Roman domination. II
This page was built for publication: New results on quadruple Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174161)