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

(43)

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

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)