Exploring the influence of graph operations on zero forcing sets
From MaRDI portal
Cites work
- Characterizations of outerplanar graphs
- Complexity and computation of connected zero forcing
- Domination in Graphs Applied to Electric Power Networks
- Dynamic approach to k-forcing
- Fast-mixed searching and related problems on graphs
- Fractional zero forcing via three-color forcing games
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Leaky forcing: a new variation of zero forcing
- On minimum rank and zero forcing sets of a graph
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Positive semidefinite zero forcing
- Probabilistic zero forcing on random graphs
- Probalistic zero forcing in graphs
- Reconfiguration graphs of zero forcing sets
- Restricted power domination and zero forcing problems
- The zero forcing polynomial of a graph
- Using variants of zero forcing to bound the inertia set of a graph
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- Zero forcing and power domination for graph products
- Zero forcing for sign patterns
- Zero forcing number, path cover number, and maximum nullity of cacti
- Zero forcing parameters and minimum rank problems
- Zero forcing sets and the minimum rank of graphs
- Zero forcing with random sets
This page was built for publication: Exploring the influence of graph operations on zero forcing sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6979266)
