# On the Complexity of Reinforcement in Graphs

Discussiones Mathematicae Graph Theory (2016)

- Volume: 36, Issue: 4, page 877-887
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topNader Jafari Rad. "On the Complexity of Reinforcement in Graphs." Discussiones Mathematicae Graph Theory 36.4 (2016): 877-887. <http://eudml.org/doc/287069>.

@article{NaderJafariRad2016,

abstract = {We show that the decision problem for p-reinforcement, p-total rein- forcement, total restrained reinforcement, and k-rainbow reinforcement are NP-hard for bipartite graphs.},

author = {Nader Jafari Rad},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {domination; total domination; total restrained domination; p- domination; k-rainbow domination; reinforcement; NP-hard; -domination; -rainbow domination; NP-hardness},

language = {eng},

number = {4},

pages = {877-887},

title = {On the Complexity of Reinforcement in Graphs},

url = {http://eudml.org/doc/287069},

volume = {36},

year = {2016},

}

TY - JOUR

AU - Nader Jafari Rad

TI - On the Complexity of Reinforcement in Graphs

JO - Discussiones Mathematicae Graph Theory

PY - 2016

VL - 36

IS - 4

SP - 877

EP - 887

AB - We show that the decision problem for p-reinforcement, p-total rein- forcement, total restrained reinforcement, and k-rainbow reinforcement are NP-hard for bipartite graphs.

LA - eng

KW - domination; total domination; total restrained domination; p- domination; k-rainbow domination; reinforcement; NP-hard; -domination; -rainbow domination; NP-hardness

UR - http://eudml.org/doc/287069

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.