The N_k-valued Roman domination and its boundaries

DOI10.1016/J.ENDM.2015.05.014MaRDI QIDQ324921zbMATH OpenOpenAlexFDO

Authors Andreas Dwi Maryanto Gunawan, K. M. Koh

Publication date 17 October 2016

Full work available at URL https://doi.org/10.1016/j.endm.2015.05.014

zbMATH Keywords

diameterdomination numberradiusRoman domination

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Roman \(k\)-domination in graphs
• Extremal problems for roman domination
• Bounds on Roman domination numbers of graphs
• The Roman (k, k)-domatic number of a graph
• Roman k-domination of digraphs

Cites work

• Bounds on Roman domination numbers of graphs
• Defending the Roman Empire---a new strategy
• scientific article; zbMATH DE number 2109329 (Why is no real title available?)
• Lower bounds for the domination number
• Roman \(k\)-domination in graphs
• Roman domination in graphs.
• The distance Roman domination numbers of graphs

This page was built for publication: The \(\mathbb{N}_k\)-valued Roman domination and its boundaries

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