Zero forcing sets and bipartite circulants

DOI10.1016/j.laa.2011.09.022zbMath1236.05163arXiv1011.5851MaRDI QIDQ763073

Seth A. Meyer

Publication date: 8 March 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.5851

zbMATH Keywords

circulant matrix; minimum rank; maximum nullity; zero forcing number

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Proof of a conjecture on the zero forcing number of a graph, Extremal values and bounds for the zero forcing number, Upper bounds on the \(k\)-forcing number of a graph, Computational approaches for zero forcing and related problems, Some bounds on the zero forcing number of a graph, Bounds on the connected forcing number of a graph, Complexity and computation of connected zero forcing, On the zero forcing number of a graph involving some classical parameters, Typical and generic ranks in matrix completion, On tight bounds for the \(k\)-forcing number of a graph

Cites Work

• Unnamed Item
• An upper bound for the minimum rank of a graph
• Techniques for determining the minimum rank of a small graph
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• On planarity and colorability of circulant graphs
• Zero forcing sets and the minimum rank of graphs