On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453): Difference between revisions

@@ Property / cites work @@
+The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
+Normal rank
@@ Property / cites work @@
+Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
+Normal rank
@@ Property / cites work @@
+Diameter vulnerability of iterated line digraphs in terms of the girth
+Normal rank
@@ Property / cites work @@
+-connected graphs with small 2-connected dominating sets.
+Normal rank
@@ Property / cites work @@
+Q5463344
@@ Property / cites work: Q5463344 / rank @@
+Normal rank
@@ Property / cites work @@
+On the out-domination and in-domination numbers of a digraph
+Normal rank
@@ Property / cites work @@
+Super link-connectivity of iterated line digraphs.
+Normal rank
@@ Property / cites work @@
+The Hamiltonian property of generalized de Bruijn digraphs
+Normal rank
@@ Property / cites work @@
+Generalized de Bruijn digraphs
@@ Property / cites work: Generalized de Bruijn digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds on the diameter vulnerability of iterated line digraphs
+Normal rank
@@ Property / cites work @@
+Q3972098
@@ Property / cites work: Q3972098 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating Set and Converse Dominating Set of a Directed Graph
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Q4953552
@@ Property / cites work: Q4953552 / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding iterated line digraphs in books
@@ Property / cites work: Embedding iterated line digraphs in books / rank @@
+Normal rank
@@ Property / cites work @@
+Queue layouts of iterated line directed graphs
@@ Property / cites work: Queue layouts of iterated line directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368729
@@ Property / cites work: Q4368729 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
+Normal rank
@@ Property / cites work @@
+Q3428642
@@ Property / cites work: Q3428642 / rank @@
+Normal rank
@@ Property / cites work @@
+Construction of strongly connected dominating sets in asymmetric multihop wireless networks
+Normal rank
@@ Property / cites work @@
+Domination in a digraph and in its reverse
@@ Property / cites work: Domination in a digraph and in its reverse / rank @@
+Normal rank
@@ Property / cites work @@
+The twin domination number in generalized de Bruijn digraphs
+Normal rank
@@ Property / cites work @@
+Algorithms for minimum \(m\)-connected \(k\)-tuple dominating set problem
+Normal rank
@@ Property / cites work @@
+Paths, cycles, and arc‐connectivity in digraphs
@@ Property / cites work: Paths, cycles, and arc‐connectivity in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
+Normal rank
@@ Property / cites work @@
+Compatible Euler tours of \(K_n^{**}\)
@@ Property / cites work: Compatible Euler tours of \(K_n^{**}\) / rank @@
+Normal rank