Zero forcing sets and the minimum rank of graphs

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

On minimum rank and zero forcing sets of a graph
Zero forcing parameters and minimum rank problems
Minimum rank, maximum nullity and zero forcing number for selected graph families
Lower bounds in minimum rank problems
The minimum rank of symmetric matrices described by a graph: a survey

Cites work

A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
Computation of minimal rank and path cover number for certain graphs
Forbidden minors for the class of graphs G with (G) 2
Graphs whose minimal rank is two
scientific article; zbMATH DE number 1600999 (Why is no real title available?)
Inverse eigenvalue problems for Jacobi matrices
Minimum rank of a graph over an arbitrary field
On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
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
Three-connected graphs whose maximum nullity is at most three

Cited in

(only showing first 100 items - show all)

Lower bounds in minimum rank problems
On the minimum rank of regular classes of matrices of zeros and ones
Nordhaus-Gaddum problems for power domination
Computational approaches for zero forcing and related problems
Families of graphs with maximum nullity equal to zero forcing number
Graphs with real algebraic co-rank at most two
Note on power propagation time and lower bounds for the power domination number
Some bounds on the zero forcing number of a graph
On a conjecture of Gentner and Rautenbach
Infection in hypergraphs
Zero forcing number, Grundy domination number, and their variants
Throttling positive semidefinite zero forcing propagation time on graphs
Zero forcing in iterated line digraphs
On the total forcing number of a graph
Forcing brushes
The zero forcing polynomial of a graph
Complexity and inapproximability results for the power edge set problem
The relationship between \(k\)-forcing and \(k\)-power domination
Grundy dominating sequences and zero forcing sets
The extremal function and Colin de Verdière graph parameter
Bounds on the connected forcing number of a graph
Brushing number and zero-forcing number of graphs and their line graphs
Total forcing and zero forcing in claw-free cubic graphs
Approximating the minimum rank of a graph via alternating projection
Effects of vertex degrees on the zero-forcing number and propagation time of a graph
A lower bound on the zero forcing number
A new lower bound for the positive semidefinite minimum rank of a graph
A zero forcing technique for bounding sums of eigenvalue multiplicities
The inverse eigenvalue problem of a graph: multiplicities and minors
Rigid linkages and partial zero forcing
On the error of \textit{a priori} sampling: zero forcing sets and propagation time
Logic circuits from zero forcing
Total forcing versus total domination in cubic graphs
Complexity and computation of connected zero forcing
On the relationships between zero forcing numbers and certain graph coverings
Signed graphs with stable maximum nullity at most two
Zero forcing versus domination in cubic graphs
Disproofs of three conjectures on the power domination of graphs
Note on forcing problem of trees
Product throttling
Tight bounds on probabilistic zero forcing on hypercubes and grids
The language of epidemic
Strong structural controllability of networks: comparison of bounds using distances and zero forcing
On extremal graphs for zero forcing number
On the zero forcing number and spectral radius of graphs
Subgraph complementation and minimum rank
On the zero forcing number and propagation time of oriented graphs
On the semitotal forcing number of a graph
Graphs with a unique maximum independent set up to automorphisms
Upper bounds for positive semidefinite propagation time
On trees and unicyclic graphs with equal forcing-type numbers
An upper bound for the k-power domination number in r-uniform hypergraphs
Power domination in cubic graphs and Cartesian products
On the length of L-Grundy sequences
The strong spectral property for graphs
A short proof of Zhou, Wong and Sun's conjecture
Total forcing sets and zero forcing sets in trees
On the power domination number of the Cartesian product of graphs
On the zero blocking number of rectangular, cylindrical, and Möbius grids
Zero forcing and maximum nullity for hypergraphs
Blocking zero forcing processes in Cartesian products of graphs
Z-domination game
On Grundy total domination number in product graphs
Probabilistic zero forcing on random graphs
Properties of a \(q\)-analogue of zero forcing
Uniform forcing and immune sets in graphs and hypergraphs
On the inverse eigenvalue problem for block graphs
Grundy domination and zero forcing in regular graphs
On leaky forcing and resilience
On the nullity of a connected graph in terms of order and maximum degree
Critical ideals, minimum rank and zero forcing number
A short proof for a lower bound on the zero forcing number
Algorithms and applications for a class of bilevel MILPs
Infectious power domination of hypergraphs
On the zero forcing number of a graph involving some classical parameters
Zero forcing in claw-free cubic graphs
Zero forcing number of degree splitting graphs and complete degree splitting graphs
The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
Positive semidefinite zero forcing numbers of two classes of graphs
A computational comparison of compact MILP formulations for the zero forcing number
Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
Orthogonal representations of Steiner triple system incidence graphs
Extremal k-forcing sets in oriented graphs
On tight bounds for the \(k\)-forcing number of a graph
Zero forcing in triangulations
Restricted power domination and zero forcing problems
Minimum rank and zero forcing number for butterfly networks
Connected power domination in graphs
Positive semidefinite zero forcing
The inverse inertia problem for the complements of partial \(k\)-trees
Counterexamples to an edge spread question for zero forcing number
Graphs of unitary matrices and positive semidefinite zero forcing
Zero forcing for sign patterns
The minimum rank of matrices and the equivalence class graph
On the distance spectra of graphs
Compressed cliques graphs, clique coverings and positive zero forcing
Various characterizations of throttling numbers
Multi-color forcing in graphs
Throttling processes equivalent to full throttling on trees

This page was built for publication: Zero forcing sets and the minimum rank of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477541)