Some new results on distance \(k\)-domination in graphs (Q2248720)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Some new results on distance \(k\)-domination in graphs
scientific article

    Statements

    Some new results on distance \(k\)-domination in graphs (English)
    0 references
    0 references
    0 references
    27 June 2014
    0 references
    Summary: We determine the distance \(k\)-domination number for the total graph, shadow graph, and middle graph of path \(P_n\).
    0 references
    total graph
    0 references
    shadow graph
    0 references
    middle graph
    0 references

    Identifiers