Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2014.07.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059025128 / rank | |||
Normal rank | |||
Revision as of 01:10, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph |
scientific article |
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
