Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs (Q837173): Difference between revisions

@@ Property / cites work @@
+Q3852212
@@ Property / cites work: Q3852212 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-connected graphs with small 2-connected dominating sets.
+Normal rank
@@ Property / cites work @@
+On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+The diversity of domination
@@ Property / cites work: The diversity of domination / rank @@
+Normal rank
@@ Property / cites work @@
+On connected \(k\)-domination numbers of graphs.
@@ Property / cites work: On connected \(k\)-domination numbers of graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Distance paired domination numbers of graphs
@@ Property / cites work: Distance paired domination numbers of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs
@@ Property / cites work: On \(\alpha_{r}\gamma_{s}(k)\)-perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
+Normal rank
@@ Property / cites work @@
+Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
+Normal rank
@@ Property / cites work @@
+On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
+Normal rank
@@ Property / cites work @@
+Q3568754
@@ Property / cites work: Q3568754 / rank @@
+Normal rank
@@ Property / cites work @@
+The \(k\)-tuple domination number revisited
@@ Property / cites work: The \(k\)-tuple domination number revisited / rank @@
+Normal rank