On the relationship between the zero forcing number and path cover number for some graphs (Q779727): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s41980-019-00290-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3000046330
@@ Property / OpenAlex ID: W3000046330 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126404012
@@ Property / Wikidata QID: Q126404012 / rank @@
+Normal rank
@@ Property / cites work @@
+On the relationships between zero forcing numbers and certain graph coverings
+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 @@
+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 @@
+The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
+Normal rank
@@ Property / cites work @@
+A technique for computing the zero forcing number of a graph with a cut-vertex
+Normal rank
@@ 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
@@ links / mardi / name / links / mardi / name @@
+Publication:779727