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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5472338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distance-dominating cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance domination and distance irredundance in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4378634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4029974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the distance \(k\)-domination number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>R</i> -Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing and covering numbers of graphs / rank
 
Normal rank

Latest revision as of 13:22, 14 July 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
    0 references