On minimum rank and zero forcing sets of a graph

DOI10.1016/j.laa.2010.01.001zbMath1195.05043OpenAlexW2101639990MaRDI QIDQ967512

Liang-Hao Huang, Hong-Gwa Yeh, Gerard Jennhwa Chang

Publication date: 29 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.laa.2010.01.001

zbMATH Keywords

ranksymmetric matrixproduct graphminimum rankmaximum nullityzero forcing setunit interval graphblock-clique graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (29)

Computational approaches for zero forcing and related problems ⋮ Using a new zero forcing process to guarantee the strong Arnold property ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ Multi-color forcing in graphs ⋮ On the length of L-Grundy sequences ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Unnamed Item ⋮ Graphs with equal Grundy domination and independence number ⋮ Minimum rank and zero forcing number for butterfly networks ⋮ Connected power domination in graphs ⋮ The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) ⋮ Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph ⋮ A technique for computing the zero forcing number of a graph with a cut-vertex ⋮ On the minimum rank of the third power of a starlike tree ⋮ Infection in hypergraphs ⋮ Zero forcing for sign patterns ⋮ A New Lower Bound for Positive Zero Forcing ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ Grundy dominating sequences and zero forcing sets ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Complexity and computation of connected zero forcing ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ Effects of vertex degrees on the zero-forcing number and propagation time of a graph ⋮ Connected zero forcing sets and connected propagation time of graphs ⋮ Unnamed Item ⋮ Positive semidefinite zero forcing numbers of two classes of graphs

Cites Work

• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• Minimum rank problems
• Orthogonal representations, minimum rank, and graph complements
• Three-connected graphs whose maximum nullity is at most three
• On acyclic and unicyclic graphs whose minimum rank equals the diameter
• An upper bound for the minimum rank of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• Inverse eigenvalue problems for Jacobi matrices
• Computation of minimal rank and path cover number for certain graphs
• The maximum corank of graphs with a 2-separation
• Zero forcing sets and the minimum rank of graphs
• On the compatibility between a graph and a simple order
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• Matrix Analysis
• Graphs whose minimal rank is two
• Graphs whose minimal rank is two: The finite fields case
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On minimum rank and zero forcing sets of a graph