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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank

Latest revision as of 20:50, 3 July 2024

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