Zero forcing sets and the minimum rank of graphs
From MaRDI portal
Publication:2477541
DOI10.1016/j.laa.2007.10.009zbMath1135.05035OpenAlexW2175011670MaRDI QIDQ2477541
Sebastian M. Cioabă, Amy Wangsness Wehe, Kevin N. Vander Meulen, Willem H. Haemers, Steve Butler, Irene Sciriha, Rana Mikkelson, Sivaram K. Narayan, Hein van der Holst, Dragan Stevanović, Leslie Hogben, Olga Pryporova, Wayne W. Barrett, Shaun M. Fallat, Francesco Barioli, Wa-Sin So, Dragos Cvetković, Chris D. Godsil
Publication date: 14 March 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1103&context=math_pubs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (only showing first 100 items - show all)
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 ⋮ Nordhaus-Gaddum problems for power domination ⋮ On the semitotal forcing number of a graph ⋮ Computational approaches for zero forcing and related problems ⋮ Using a new zero forcing process to guarantee the strong Arnold property ⋮ Graphs with a unique maximum independent set up to automorphisms ⋮ 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 ⋮ Extremal values and bounds for the zero forcing number ⋮ Minimum rank problems ⋮ Families of graphs with maximum nullity equal to zero forcing number ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ An upper bound for the \(k\)-power domination number in \(r\)-uniform hypergraphs ⋮ Power domination in cubic graphs and Cartesian products ⋮ Graphs with real algebraic co-rank at most two ⋮ 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 ⋮ Note on power propagation time and lower bounds for the power domination number ⋮ Bounds for minimum semidefinite rank from superpositions and cutsets ⋮ On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ Zero forcing and maximum nullity for hypergraphs ⋮ A new lower bound for the positive semidefinite minimum rank of a graph ⋮ Positive semidefinite propagation time ⋮ Some bounds on the zero forcing number of a graph ⋮ Minimum rank of outerplanar graphs ⋮ Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph ⋮ On the graph complement conjecture for minimum rank ⋮ 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 ⋮ The minimum semidefinite rank of the complement of partial \(k\)-trees ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ Z-domination game ⋮ On a conjecture of Gentner and Rautenbach ⋮ Infection in hypergraphs ⋮ Propagation time for zero forcing on a graph ⋮ The minimum rank of universal adjacency matrices ⋮ Zero forcing number, Grundy domination number, and their variants ⋮ On Grundy total domination number in product graphs ⋮ Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs ⋮ Throttling positive semidefinite zero forcing propagation time on graphs ⋮ Orthogonal representations, minimum rank, and graph complements ⋮ Zero forcing in iterated line digraphs ⋮ Probabilistic zero forcing on random graphs ⋮ On the total forcing number of a graph ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Forcing brushes ⋮ The zero forcing polynomial of a graph ⋮ Zero forcing number, constrained matchings and strong structural controllability ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ Complexity and inapproximability results for the power edge set problem ⋮ The inverse eigenvalue problem of a graph: multiplicities and minors ⋮ An upper bound for the minimum rank of a graph ⋮ The relationship between \(k\)-forcing and \(k\)-power domination ⋮ Lower bounds for positive semidefinite zero forcing and their applications ⋮ 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 ⋮ Zero forcing propagation time on oriented graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Minimum rank of skew-symmetric matrices described by a graph ⋮ 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 ⋮ On minimum rank and zero forcing sets of a graph ⋮ Techniques for determining the minimum rank of a small graph ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ Zero forcing parameters and minimum rank problems ⋮ A note on universally optimal matrices and field independence of the minimum rank of a graph ⋮ 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 ⋮ Approximating the minimum rank of a graph via alternating projection ⋮ Throttling for the game of cops and robbers on graphs ⋮ On the complexity of failed zero forcing ⋮ Effects of vertex degrees on the zero-forcing number and propagation time of a graph ⋮ A lower bound on the zero forcing number ⋮ Disproofs of three conjectures on the power domination of graphs ⋮ Note on forcing problem of trees ⋮ Zero forcing sets and bipartite circulants ⋮ Product throttling ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids ⋮ Grundy dominating sequences on \(X\)-join product ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three ⋮ Power domination in regular claw-free graphs ⋮ The language of epidemic ⋮ On the relationship between the zero forcing number and path cover number for some graphs ⋮ Lower bounds in minimum rank problems ⋮ Strong structural controllability of networks: comparison of bounds using distances and zero forcing ⋮ On extremal graphs for zero forcing number ⋮ On the distance spectra of graphs
Cites Work
- Unnamed Item
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- Three-connected graphs whose maximum nullity is at most three
- 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
- 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
- Graphs whose minimal rank is two
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
This page was built for publication: Zero forcing sets and the minimum rank of graphs
