A general method in the theory of domination in graphs (Q3066944)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A general method in the theory of domination in graphs
scientific article

    Statements

    A general method in the theory of domination in graphs (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2011
    0 references
    0 references
    tree
    0 references
    domination
    0 references
    irredundance
    0 references
    distance domination
    0 references
    connected domination
    0 references
    total domination
    0 references
    distance irredundance
    0 references
    \(p\)-domination
    0 references
    end domination
    0 references
    weakly connected domination
    0 references
    paired domination
    0 references
    double domination
    0 references
    \(p\)-tuple domination
    0 references
    restrained domination
    0 references
    weak domination
    0 references
    0 references