Distance domination in graphs with given minimum and maximum degree (Q2410104): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 20:32, 2 February 2024

scientific article
Language Label Description Also known as
English
Distance domination in graphs with given minimum and maximum degree
scientific article

    Statements

    Distance domination in graphs with given minimum and maximum degree (English)
    0 references
    0 references
    0 references
    17 October 2017
    0 references
    For an integer \(k\geq 1\), a distance \(k\)-dominating set of a connected graph \(G\) is a set \(S\) of verices of \(G\) such that every vertex of \(V(G)\) is at distance at most \(k\) from some vertex of \(S\). The distance domination number \(\gamma_k(G)\) of \(G\) is the minimum cardinality of a distance \(k\)-dominating set of \(G\). In the paper under review, it was shown that for \(k\geq 2\), if \(G\) is a connected graph with minimum degree \(\delta\geq 2\) and maximum \(\Delta\) and of order \(n\geq \Delta+k-1,\) then \(\gamma_k(G)\leq \frac {n+\delta-\Delta} {\delta+k-1}\). This result improves some known results.
    0 references
    distance domination
    0 references
    minimum degree
    0 references
    maximum degree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references