Compatible forts and maximum nullity of a graph
From MaRDI portal
Cites work
- Almost all matroids are nonrepresentable
- An upper bound for the minimum rank of a graph
- Computation of minimal rank and path cover number for certain graphs
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- Graphs and geometry
- Handbook of linear algebra
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Inverse Problems and Zero Forcing for Graphs
- Is the missing axiom of matroid theory lost forever?
- Nullspace embeddings for outerplanar graphs
- Odd cycle zero forcing parameters and the minimum rank of graph blowups
- On the Vector Representation of Matroids
- On zero-sum 6-flows of graphs
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Sparks of symmetric matrices and their graphs
- Techniques for determining the minimum rank of a small graph
- The strong spectral property for graphs
- The strong spectral property of graphs: graph operations and barbell partitions
- Zero forcing sets and the minimum rank of graphs
- Zero-sum flows in regular graphs
This page was built for publication: Compatible forts and maximum nullity of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993734)