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\)-domination; Roman domination number; Roman \(k\)-domination

Mathematics Subject Classification ID

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

Related Items

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