Minimal zero forcing sets
From MaRDI portal
Publication:6644905
Publication date: 28 November 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Fast-mixed searching and related problems on graphs
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Zero forcing number, constrained matchings and strong structural controllability
- On the max min vertex cover problem
- On minimum maximal independent sets of a graph
- Computational approaches for zero forcing and related problems
- The many facets of upper domination
- The zero forcing polynomial of a graph
- Some results on the target set selection problem
- Logic circuits from zero forcing
- Tight approximation ratio for Minimum Maximal Matching
- Zero forcing sets and the minimum rank of graphs
- Reconfiguration graphs of zero forcing sets
- Upper Domination: Complexity and Approximation
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover
- Domination in Graphs Applied to Electric Power Networks
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Constructions of cospectral graphs with different zero forcing numbers
- The PMU Placement Problem
This page was built for publication: Minimal zero forcing sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644905)
