An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree (Q967326)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree |
scientific article |
Statements
An upper bound for the restrained domination number of a graph with minimum degree at least two in terms of order and minimum degree (English)
0 references
28 April 2010
0 references
graph
0 references
domination
0 references
restrained domination
0 references
minimum degree
0 references
order of a graph
0 references
upper bound
0 references
0 references
0 references
