New results on quadruple Roman domination in graphs
From MaRDI portal
Publication:6174161
DOI10.1142/S1793830922500781zbMATH Open1516.05157OpenAlexW4223911593MaRDI QIDQ6174161FDOQ6174161
Authors: J. Amjadi, N. Khalili 
Publication date: 14 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500781
Recommendations
Nordhaus-Gaddum boundquadruple Roman domination\([k\)-Roman domination]
Cites Work
- Roman domination in graphs.
- Roman domination in graphs
- Double Roman domination
- Title not available (Why is that?)
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- Double Roman domination and domatic numbers of graphs
- Varieties of Roman domination. II
- Title not available (Why is that?)
- Outer independent double Roman domination
- Triple Roman domination in graphs
- Total double Roman domination in graphs
- Varieties of Roman Domination
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Maximal double Roman domination in graphs
- Bounds on the signed total Roman 2-domination in graphs
- Algorithmic aspects of outer independent Roman domination in graphs
- The double Roman domination number of generalized Sierpiński graphs
- Quadruple Roman domination in graphs
- Graphs whose weak Roman domination number increases by the deletion of any edge
- Title not available (Why is that?)
- Resolving Roman domination in graphs
- Isolate Roman domination in graphs
- Algorithmic aspects of total Roman ${2}$-domination in graphs
Cited In (2)
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)
