Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351)
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: Upper bounds on the balanced r, s -domination number of a graph |
scientific article; zbMATH DE number 6376321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph |
scientific article; zbMATH DE number 6376321 |
Statements
Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (English)
0 references
3 December 2014
0 references
\(\mathbf s\)-dominating \(\mathbf r\)-function
0 references
\(\langle \mathbf{r} \mathbf{s} \rangle\)-domination
0 references
\(k\)-tuple domination
0 references
multiple domination
0 references
probabilistic method
0 references
0.9124353
0 references
0.9098902
0 references
0.90904367
0 references
0.9072164
0 references
0.8993499
0 references
0.8987204
0 references
0.8986804
0 references
