A technique for computing the zero forcing number of a graph with a cut-vertex

Recommendations

Zero forcing parameters and minimum rank problems
Zero forcing sets and the minimum rank of graphs
Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
Zero forcing number, path cover number, and maximum nullity of cacti
On minimum rank and zero forcing sets of a graph

Cites work

Minimum rank problems
Nondiscriminatory propagation on trees
On minimum rank and zero forcing sets of a graph
On the difference between the maximum multiplicity and path cover number for tree-like graphs
On the minimum rank of not necessarily symmetric matrices: A preliminary study
The graphs for which the maximum multiplicity of an eigenvalue is two
The minimum rank of symmetric matrices described by a graph: a survey
Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
Zero forcing parameters and minimum rank problems
Zero forcing sets and the minimum rank of graphs

Cited in

(52)

Computational approaches for zero forcing and related problems
Families of graphs with maximum nullity equal to zero forcing number
Some bounds on the zero forcing number of a graph
The zero forcing polynomial of a graph
Rigid linkages and partial zero forcing
Complexity and computation of connected zero forcing
On the relationships between zero forcing numbers and certain graph coverings
Zero forcing versus domination in cubic graphs
On extremal graphs for zero forcing number
On the zero forcing number and spectral radius of graphs
On trees and unicyclic graphs with equal forcing-type numbers
Properties of a \(q\)-analogue of zero forcing
On leaky forcing and resilience
On the zero forcing number of a graph involving some classical parameters
Zero forcing number of degree splitting graphs and complete degree splitting graphs
Positive semidefinite zero forcing numbers of two classes of graphs
A computational comparison of compact MILP formulations for the zero forcing number
Extremal k-forcing sets in oriented graphs
On tight bounds for the \(k\)-forcing number of a graph
Zero forcing in triangulations
Restricted power domination and zero forcing problems
Line graphs: their maximum nullities and zero forcing numbers.
On the singularity of graphs: zero forcing parameters
Extremal values and bounds for the zero forcing number
Propagation time for zero forcing on a graph
Zero forcing number, path cover number, and maximum nullity of cacti
Upper bounds on the \(k\)-forcing number of a graph
Parameters related to tree-width, zero forcing, and maximum nullity of a graph
Graphs with total forcing number two, revisited
Zero forcing number of a graph in terms of the number of pendant vertices
Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
Failed power domination on graphs
On the zero forcing number of graphs and their splitting graphs
On the zero forcing number of generalized Sierpiński graphs
On zero forcing number of graphs and their complements
On graphs maximizing the zero forcing number
Open global shadow graph and it’s zero forcing number
Zero forcing with random sets
Bounds on zero forcing using (upper) total domination and minimum degree
On the zero forcing number of the complement of graphs with forbidden subgraphs
An approximation algorithm for zero forcing
Zero forcing number and propagation time discrepancy of some graphs
Bounds for zero forcing numbers of connected graphs with fixed order and maximum degree
Zero forcing number for Cartesian product of some graphs
Semitotal forcing in claw-free cubic graphs
Zero forcing, graphs on k parallel paths, and linear preservers
An efficient algorithm for power dominating set
The zero forcing number of expanded paths and cycles
Forts, (fractional) zero forcing, and Cartesian products of graphs
Maximum nullity and zero forcing number on graphs with maximum degree at most three
On the relationship between the zero forcing number and path cover number for some graphs
Positive semidefinite propagation time

This page was built for publication: A technique for computing the zero forcing number of a graph with a cut-vertex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417535)