An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
type: Item
instance of: scholarly article
title: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree
zbMATH Open document ID: 1209.05170
author: Johannes H. Hattingh
author: Ernst J. Joubert
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5702599
zbMATH Keywords: graph
zbMATH Keywords: domination
zbMATH Keywords: restrained domination
zbMATH Keywords: minimum degree
zbMATH Keywords: order of a graph
zbMATH Keywords: upper bound
MaRDI profile type: Publication
full work available at URL: j.dam.2009.03.010
OpenAlex ID: W1982805968
cites work: Q3277097
cites work: On total restrained domination in graphs
cites work: On equality in an upper bound for the restrained and total domination numbers of a graph
cites work: Trees with equal domination and restrained domination numbers
cites work: Restrained domination in graphs
cites work: Restrained domination in trees
cites work: Restrained domination in graphs with minimum degree two
cites work: On equality in an upper bound for domination parameters of graphs
cites work: Q3070295
cites work: An upper bound on the total restrained domination number of a tree
cites work: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
cites work: Total restrained domination in trees
cites work: Q3094567
cites work: Q4368729
cites work: Graphs with large restrained domination number
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
cites work: Remarks on restrained domination and total restrained domination in graphs
DOI: 10.1016/J.DAM.2009.03.010
description: scientific article; zbMATH DE number 5702599