Restrained {2}-domination in graphs
From MaRDI portal
Publication:6140951
DOI10.1051/RO/2023120MaRDI QIDQ6140951
Seyyed Mahmoud Sheikholeslami, Kazhal Haghparast, Mustapha Chellali, Jafar Amjadi
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
NP-completenessrestrained domination numberrestrained \(\{2\}\)-dominating functionrestrained \(\{2\}\)-domination number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total restrained domination in graphs
- Restrained double domination number of a graph
- Restrained domination in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Restrained condition on double Roman dominating functions
- The restrained double Roman domination in graphs
- Restrained and Total Restrained Domination in Graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Restrained Italian domination in graphs
- Bounds on the restrained Roman domination number of a graph
This page was built for publication: Restrained {2}-domination in graphs