Using Markov chains to determine expected propagation time for probabilistic zero forcing (Q3299342): 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 @@
+Q5374237
@@ Property / cites work: Q5374237 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3622244
@@ Property / cites work: Q3622244 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2866604
@@ Property / cites work: Q2866604 / rank @@
+Normal rank
@@ Property / cites work @@
+Iteration Index of a Zero Forcing Set in a Graph
@@ Property / cites work: Iteration Index of a Zero Forcing Set in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum rank of symmetric matrices described by a graph: a survey
+Normal rank
@@ Property / cites work @@
+Propagation time for zero forcing on a graph
@@ Property / cites work: Propagation time for zero forcing on a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4902474
@@ Property / cites work: Q4902474 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Zero Forcing in Graphs
@@ Property / cites work: Probabilistic Zero Forcing in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Positive semidefinite propagation time
@@ Property / cites work: Positive semidefinite propagation time / rank @@
+Normal rank
@@ Property / cites work @@
+Fast-mixed searching and related problems on graphs
+Normal rank