Zero forcing sets and the minimum rank of graphs
From MaRDI portal
Publication:2477541
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- 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
- 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)- Minimum-rank and maximum-nullity of graphs and their linear preservers
- Zero forcing and power domination for graph products
- On the distance spectra of graphs
- Zero forcing and maximum nullity for hypergraphs
- An integer program for positive semidefinite zero forcing in graphs
- A lower bound on the failed zero-forcing number of a graph
- Probabilistic zero forcing on random graphs
- Infectious power domination of hypergraphs
- scientific article; zbMATH DE number 7528059 (Why is no real title available?)
- On the rank spread of graphs
- Positive zero forcing and edge clique coverings
- Propagation time for probabilistic zero forcing
- Positive semidefinite zero forcing numbers of two classes of graphs
- The extremal function and Colin de Verdière graph parameter
- Zero forcing in iterated line digraphs
- The inverse eigenvalue problem of a graph: multiplicities and minors
- Signed graphs with stable maximum nullity at most two
- \(k\)-forcing number for Cartesian product of some graphs
- A computational comparison of compact MILP formulations for the zero forcing number
- Maximum nullity, zero forcing number and propagation time of \(\ell\)-path graphs
- Graphs with a unique maximum independent set up to automorphisms
- Positive semidefinite maximum nullity and zero forcing number
- Blocking zero forcing processes in Cartesian products of graphs
- On the inverse eigenvalue problem for block graphs
- Maximum nullity of some Cayley graphs
- Grundy domination and zero forcing in Kneser graphs
- On the zero forcing number and propagation time of oriented graphs
- Lower bounds in minimum rank problems
- Upper bounds for positive semidefinite propagation time
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing
- Counterexamples to an edge spread question for zero forcing number
- Forcing brushes
- The zero forcing polynomial of a graph
- Brushing number and zero-forcing number of graphs and their line graphs
- On the power domination number of graph products
- On the zero forcing number of a graph involving some classical parameters
- On the zero forcing number of generalized Sierpiński graphs
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs
- A lower bound on the zero forcing number
- Connected power domination in graphs
- scientific article; zbMATH DE number 7687776 (Why is no real title available?)
- Maximum nullity and zero forcing number of graphs with rank at most 4
- Graphs of unitary matrices and positive semidefinite zero forcing
- Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems
- Minimum rank of outerplanar graphs
- On the graph complement conjecture for minimum rank
- On the minimum rank of the third power of a starlike tree
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- A note on universally optimal matrices and field independence of the minimum rank of a graph
- Properties of a \(q\)-analogue of zero forcing
- Leaky forcing: a new variation of zero forcing
- Grundy domination and zero forcing in regular graphs
- Failed power domination on graphs
- Extremal k-forcing sets in oriented graphs
- Graph complement conjecture for classes of shadow graphs
- Some product graphs with power dominating number at most 2
- Minimum rank, maximum nullity and zero forcing number for selected graph families
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- The relationship between \(k\)-forcing and \(k\)-power domination
- Improved Computational Approaches and Heuristics for Zero Forcing
- Algorithms and applications for a class of bilevel MILPs
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Total forcing versus total domination in cubic graphs
- On the L-Grundy domination number of a graph
- Uniform forcing and immune sets in graphs and hypergraphs
- Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes
- Some Cayley graphs with propagation time of at most two
- Algorithms and complexity of power domination in graphs
- Maximum nullity and zero forcing number on graphs with maximum degree at most three
- Minimum rank, maximum nullity, and zero forcing number of simple digraphs
- The inverse inertia problem for the complements of partial \(k\)-trees
- Using Markov chains to determine expected propagation time for probabilistic zero forcing
- Fuzzy forcing set on fuzzy graphs. Definition and its application in social networks
- Nordhaus-Gaddum problems for power domination
- Orthogonal representations, minimum rank, and graph complements
- On leaky forcing and resilience
- Solving systems of linear equations through zero forcing set
- On the power domination number of the Cartesian product of graphs
- Throttling for the game of cops and robbers on graphs
- Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
- Computing the zero forcing number for generalized Petersen graphs
- The minimum rank problem for circulants
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- A short proof of Zhou, Wong and Sun's conjecture
- Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
- Line graphs: their maximum nullities and zero forcing numbers.
- Fuzzification of Zero Forcing Process
- A New Fuzzy Propagation Model for Influence Maximization in Social Networks
- The Zero Forcing Number of Graphs
- On the semitotal forcing number of a graph
- Zero forcing versus domination in cubic graphs
- Logic circuits from zero forcing
- Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph
- Using a new zero forcing process to guarantee the strong Arnold property
- Bounds on zero forcing using (upper) total domination and minimum degree
- Open global shadow graph and it’s zero forcing number
- The liberation set in the inverse eigenvalue problem of a graph
- Families of graphs with maximum nullity equal to zero forcing number
- On Grundy total domination number in product graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
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)
