An upper bound for the minimum rank of a graph
From MaRDI portal
Recommendations
Cites work
Cited in
(49)- Lower bounds in minimum rank problems
- Families of graphs with maximum nullity equal to zero forcing number
- Graphs with real algebraic co-rank at most two
- On order and rank of graphs
- Bounds on expected propagation time of probabilistic zero forcing
- On extremal graphs for zero forcing number
- A linear time algorithm for the nullity of vertex-weighted block graphs
- Nonsingular (vertex-weighted) block graphs
- A short proof for a lower bound on the zero forcing number
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- Unitary matrix digraphs and minimum semidefinite rank
- Some properties of the closed global shadow graphs and their zero forcing number
- On the rank spread of graphs
- On the minimum semidefinite rank of a simple graph
- On the possible ranks among matrices with a given pattern
- On the minimum vector rank of multigraphs
- Proof of a conjecture on the zero forcing number of a graph
- On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
- Minimum rank of a graph over an arbitrary field
- Universally optimal matrices and field independence of the minimum rank of a graph
- Minimum rank of edge subdivisions of graphs
- On the graph complement conjecture for minimum rank
- On the minimum rank of the third power of a starlike tree
- The minimum rank of universal adjacency matrices
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- The relationship between triangle size and minimum rank for 7 7 zero-nonzero patterns
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Minimum-rank and maximum-nullity of graphs and their linear preservers
- Matroids and the minimum rank problem for matrix patterns
- Bounds on minimum semidefinite rank of graphs
- Maximum nullity and zero forcing number of graphs with rank at most 4
- On zero forcing number of graphs and their complements
- Determining the minimum rank of matroids whose basis graph is common
- scientific article; zbMATH DE number 3221981 (Why is no real title available?)
- Some Cayley graphs with propagation time 1
- The minimum rank problem for circulants
- scientific article; zbMATH DE number 7692355 (Why is no real title available?)
- Open global shadow graph and it’s zero forcing number
- Maximum nullity, zero forcing number and propagation time of -path graphs
- Some Cayley graphs with propagation time of at most two
- Zero forcing number and propagation time discrepancy of some graphs
- Zero forcing number and maximum nullity of general power graphs
- Compatible forts and maximum nullity of a graph
- Zero forcing sets and bipartite circulants
- On the minimum rank of a graph over finite fields
- Maximum generic nullity of a graph
- On minimum rank and zero forcing sets of a graph
- Techniques for determining the minimum rank of a small graph
- Expected values of parameters associated with the minimum rank of a graph
This page was built for publication: An upper bound for the minimum rank of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947626)