An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582)

From MaRDI portal
Revision as of 19:01, 4 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An upper bound on the paired-domination number in terms of the number of edges in the graph
scientific article

    Statements

    An upper bound on the paired-domination number in terms of the number of edges in the graph (English)
    0 references
    0 references
    19 October 2010
    0 references
    0 references
    bounds
    0 references
    paired domination set
    0 references
    paired domination number
    0 references
    minimum degree 2
    0 references
    size
    0 references
    perfect matching
    0 references