An upper bound for the total restrained domination number of graphs (Q367057)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6211652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the total restrained domination number of graphs |
scientific article; zbMATH DE number 6211652 |
Statements
An upper bound for the total restrained domination number of graphs (English)
0 references
26 September 2013
0 references
total restrained domination number
0 references
total restrained dominating set
0 references
independent set
0 references
matching
0 references
probabilistic method
0 references
open packing
0 references
0.98108715
0 references
0 references
0.9687515
0 references
0.9685326
0 references
0.9651178
0 references
0.9558979
0 references
0.95018363
0 references
0.9450507
0 references
0 references
0.94332075
0 references
