A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535): 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 the minimum rank of not necessarily symmetric matrices: A preliminary study
+Normal rank
@@ Property / cites work @@
+On the difference between the maximum multiplicity and path cover number for tree-like graphs
+Normal rank
@@ Property / cites work @@
+Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
+Normal rank
@@ Property / cites work @@
+The minimum rank of symmetric matrices described by a graph: a survey
+Normal rank
@@ Property / cites work @@
+Minimum rank problems
@@ Property / cites work: 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 @@
+The graphs for which the maximum multiplicity of an eigenvalue is two
+Normal rank
@@ Property / cites work @@
+Nondiscriminatory propagation on trees
@@ Property / cites work: Nondiscriminatory propagation on trees / rank @@
+Normal rank