Some properties of the closed global shadow graphs and their zero forcing number
From MaRDI portal
Publication:2674159
Recommendations
Cites work
- A protocol for cooling and controlling composite systems by local interactions
- An upper bound for the minimum rank of a graph
- Domination in Graphs Applied to Electric Power Networks
- Logic circuits from zero forcing
- Odd graceful labeling of some new graphs
- On the zero forcing number of graphs and their splitting graphs
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Power domination in graphs
- Some Theorems on Abstract Graphs
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing in claw-free cubic graphs
- Zero forcing number of degree splitting graphs and complete degree splitting graphs
- Zero forcing number, constrained matchings and strong structural controllability
- Zero forcing sets and the minimum rank of graphs
This page was built for publication: Some properties of the closed global shadow graphs and their zero forcing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674159)