Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351): Difference between revisions

From MaRDI portal
Normalize DOI.
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2014.07.016 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2014.07.016 / rank
 
Normal rank

Latest revision as of 18:41, 9 December 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
    0 references
    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

    Identifiers