A note on the upper bound for the paired-domination number of a graph with minimum degree at least two (Q3082598)

From MaRDI portal
Revision as of 01:49, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two
scientific article

    Statements

    A note on the upper bound for the paired-domination number of a graph with minimum degree at least two (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2011
    0 references
    paired-domination number
    0 references
    upper bound
    0 references
    minimum degree
    0 references

    Identifiers