Zero forcing parameters and minimum rank problems
From MaRDI portal
Publication:975607
DOI10.1016/j.laa.2010.03.008zbMath1209.05139arXiv1003.2028OpenAlexW2099618798MaRDI QIDQ975607
Francesco Barioli, Hein van der Holst, Shaun M. Fallat, Leslie Hogben, H. Tracy Hall, Pauline van den Driessche, Wayne W. Barrett, Bryan L. Shader
Publication date: 10 June 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.2028
minimum rankmaximum nullityzero forcing numberpositive semidefinite minimum rankpositive semidefinite zero forcing numberordered set numberpositive semidefinite maximum nullity
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (98)
On the zero forcing number and spectral radius of graphs ⋮ Identifying combinatorially symmetric Hidden Markov Models ⋮ Leader selection for strong structural controllability of single-integrator multi-agent systems ⋮ Computational approaches for zero forcing and related problems ⋮ Positive Semidefinite Zero Forcing: Complexity and Lower Bounds ⋮ Using a new zero forcing process to guarantee the strong Arnold property ⋮ Fractional zero forcing via three-color forcing games ⋮ Proof of a conjecture on the zero forcing number of a graph ⋮ Failed skew zero forcing on a graph ⋮ Upper bounds for positive semidefinite propagation time ⋮ k-Forcing number for Cartesian product of some graphs ⋮ Compressed cliques graphs, clique coverings and positive zero forcing ⋮ Families of graphs with maximum nullity equal to zero forcing number ⋮ Unnamed Item ⋮ Proper colorings from positive semidefinite zero forcing sets ⋮ Tight Frame Graphs Arising as Line Graphs ⋮ Ordered multiplicity inverse eigenvalue problem for graphs on six vertices ⋮ Multi-color forcing in graphs ⋮ A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs ⋮ On the length of L-Grundy sequences ⋮ Orthogonal representations of Steiner triple system incidence graphs ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Throttling processes equivalent to full throttling on trees ⋮ The Complexity of the Positive Semidefinite Zero Forcing ⋮ Unnamed Item ⋮ Constructing a controllable graph under edge constraints ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ Vector representations of graphs and distinguishing quantum product states with one-way LOCC ⋮ A new lower bound for the positive semidefinite minimum rank of a graph ⋮ An integer program for positive semidefinite zero forcing in graphs ⋮ Positive semidefinite propagation time ⋮ 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 ⋮ Reconfiguration graphs of zero forcing sets ⋮ Failed zero forcing and critical sets on directed graphs ⋮ Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ The minimum semidefinite rank of a triangle-free graph ⋮ Sparks of symmetric matrices and their graphs ⋮ Zero forcing with random sets ⋮ Infection in hypergraphs ⋮ Positive semidefinite zero forcing ⋮ Propagation time for zero forcing on a graph ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ Unnamed Item ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Propagation tree decompositions and linearly independent vertices ⋮ Throttling positive semidefinite zero forcing propagation time on graphs ⋮ Probabilistic zero forcing on random graphs ⋮ Positive Zero Forcing and Edge Clique Coverings ⋮ A New Lower Bound for Positive Zero Forcing ⋮ Properties of a \(q\)-analogue of zero forcing ⋮ The zero forcing polynomial of a graph ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ Grundy domination and zero forcing in regular graphs ⋮ The inverse eigenvalue problem of a graph: multiplicities and minors ⋮ Constructions of cospectral graphs with different zero forcing numbers ⋮ Strong structural controllability of colored structured systems ⋮ On leaky forcing and resilience ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ Lower bounds for positive semidefinite zero forcing and their applications ⋮ Grundy dominating sequences and zero forcing sets ⋮ Brushing number and zero-forcing number of graphs and their line graphs ⋮ Propagation time for probabilistic zero forcing ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ Bounds on minimum semidefinite rank of graphs ⋮ On the graph complement conjecture for minimum semidefinite rank ⋮ Complexity and computation of connected zero forcing ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ Failed power domination on graphs ⋮ Throttling for the game of cops and robbers on graphs ⋮ Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups ⋮ On the complexity of failed zero forcing ⋮ On the complexity of the positive semidefinite zero forcing number ⋮ The minimum rank problem for circulants ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Effects of vertex degrees on the zero-forcing number and propagation time of a graph ⋮ A lower bound on the zero forcing number ⋮ Connected zero forcing sets and connected propagation time of graphs ⋮ Zero forcing number of a graph in terms of the number of pendant vertices ⋮ Skew throttling ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ Strong Structural Controllability and Leader Selection for Multi-agent Systems with Unidirectional Topology ⋮ Note on forcing problem of trees ⋮ Line graphs: Their maximum nullities and zero forcing numbers ⋮ Zero forcing sets and bipartite circulants ⋮ Positive semidefinite zero forcing numbers of two classes of graphs ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids ⋮ Unnamed Item ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three ⋮ On the relationship between the zero forcing number and path cover number for some graphs ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ On zero forcing number of graphs and their complements ⋮ Graph complement conjecture for classes of shadow graphs ⋮ Fuzzification of Zero Forcing Process
Cites Work
- Linearly independent vertices and minimum semidefinite rank
- Maximum nullity of outerplanar graphs and the path cover number
- The minimum rank of symmetric matrices described by a graph: a survey
- Lower bounds in minimum rank problems
- Olga, matrix theory and the Taussky unification problem
- Graphs whose positive semi-definite matrices have nullity at most two
- Multiplicities of eigenvalues and tree-width of graphs
- Computation of minimal rank and path cover number for certain graphs
- Zero forcing sets and the minimum rank of graphs
- On the maximum positive semi-definite nullity and the cycle matroid of graphs
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- 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
This page was built for publication: Zero forcing parameters and minimum rank problems
