Zero forcing number and maximum nullity of general power graphs
From MaRDI portal
Cites work
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- A lower bound on the zero forcing number
- An upper bound for the minimum rank of a graph
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Calculation of some topological indices of splices and links of graphs
- Connected zero forcing sets and connected propagation time of graphs
- Extremal values and bounds for the zero forcing number
- Minimum rank, maximum nullity and zero forcing number for selected graph families
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Some Cayley graphs with propagation time 1
- The minimum rank of symmetric matrices described by a graph: a survey
- The Zero Forcing Number of Graphs
- Throttling zero forcing propagation speed on graphs
- 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
This page was built for publication: Zero forcing number and maximum nullity of general power graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899836)