The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) (Q2684050): Difference between revisions

@@ Property / cites work @@
+Zero forcing sets and the minimum rank of graphs
@@ Property / cites work: Zero forcing sets and the minimum rank of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Zero forcing parameters and minimum rank problems
@@ Property / cites work: Zero forcing parameters and minimum rank problems / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum rank and zero forcing sets of a graph
@@ Property / cites work: On minimum rank and zero forcing sets of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted power domination and zero forcing problems
+Normal rank
@@ Property / cites work @@
+Zero forcing number, Grundy domination number, and their variants
+Normal rank
@@ Property / cites work @@
+Q5374237
@@ Property / cites work: Q5374237 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the positive semidefinite zero forcing number
+Normal rank
@@ Property / cites work @@
+On leaky forcing and resilience
@@ Property / cites work: On leaky forcing and resilience / rank @@
+Normal rank