ROMAN k-DOMINATION IN GRAPHS

DOI10.4134/JKMS.2009.46.6.1309zbMath1177.05084MaRDI QIDQ3652891

Lutz Volkmann, Karsten Kämmerling

Publication date: 16 December 2009

Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

domination\(k\)-dominationRoman domination numberRoman \(k\)-domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (16)

Improved bounds on the \(k\)-tuple (Roman) domination number of a graph ⋮ The \(\mathbb{N}_k\)-valued Roman domination and its boundaries ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Relations between the Roman k-domination and Roman domination numbers in graphs ⋮ The roman \(k\)-domatic number of a graph ⋮ Upper bounds on the \(k\)-tuple (Roman) domination number of a graph ⋮ On the strong Roman domination number of graphs ⋮ Roman \(k\)-domination: hardness, approximation and parameterized results ⋮ Bounds on the locating Roman domination number in trees ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ On the \(k\)-strong Roman domination problem ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Varieties of Roman Domination ⋮ Roman k-tuple domination number of a graph ⋮ Outer-independent total Roman domination in graphs ⋮ On perfect Roman domination number in trees: complexity and bounds

This page was built for publication: ROMAN k-DOMINATION IN GRAPHS