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

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.