Roman \(\{2\}\)-domination problem in graphs
type: Item
instance of: scholarly article
title: Roman \(\{2\}\)-domination problem in graphs
zbMATH Open document ID: 1485.05132
author: Hangdi Chen
author: Changhong Lu
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7495528
zbMATH Keywords: Roman \(\{2\}\)-domination
zbMATH Keywords: domination
zbMATH Keywords: algorithms
MaRDI profile type: Publication
full work available at URL: dmgt.2332
OpenAlex ID: W3032184616
cites work: Extremal Problems for Roman Domination
cites work: Total domination in block graphs
cites work: Roman \(\{2 \}\)-domination
cites work: Labelling algorithms for paired-domination problems in block and interval graphs
cites work: Roman domination in graphs.
cites work: Q3328583
cites work: Italian domination in trees
cites work: Upper bounds on Roman domination numbers of graphs
cites work: On computing a minimum secure dominating set in block graphs
cites work: Independent Roman \(\{2 \}\)-domination in graphs
cites work: Q3822197
cites work: Power domination in block graphs
DOI: 10.7151/DMGT.2332
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 7495528