Zero forcing sets and the minimum rank of graphs
From MaRDI portal
Publication:2477541
DOI10.1016/J.LAA.2007.10.009zbMATH Open1135.05035OpenAlexW2175011670MaRDI QIDQ2477541FDOQ2477541
Authors: Wayne Barrett, Steve Butler, Sebastian Cioaba, Willem H. Haemers, Leslie Hogben, Rana Mikkelson, S. K. Narayan, Olga Pryporova, Irene Sciriha, Dragan Stevanović, Hein van der Holst, Kevin N. Vander Meulen, Amy Wangsness Wehe, Francesco Barioli, Dragoš Cvetković, Shaun M. Fallat, Chris Godsil, Wasin So 
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- Title not available (Why is that?)
- Computation of minimal rank and path cover number for certain graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Forbidden minors for the class of graphs \(G\) with \(\xi (G) \leqslant 2\)
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- The minimum rank of symmetric matrices described by a graph: a survey
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Graphs whose minimal rank is two
- Inverse eigenvalue problems for Jacobi matrices
- The minimum rank problem over the finite field of order 2: Minimum rank 3
- Three-connected graphs whose maximum nullity is at most three
- Minimum rank of a graph over an arbitrary field
Cited In (only showing first 100 items - show all)
- Positive zero forcing and edge clique coverings
- On the distance spectra of graphs
- Positive semidefinite maximum nullity and zero forcing number
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing
- Lower bounds in minimum rank problems
- Maximum nullity and zero forcing number of graphs with rank at most 4
- 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
- Minimum rank, maximum nullity and zero forcing number for selected graph families
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- Minimum rank, maximum nullity, and zero forcing number of simple digraphs
- The inverse inertia problem for the complements of partial \(k\)-trees
- Maximum nullity and zero forcing number on graphs with maximum degree at most three
- Orthogonal representations, minimum rank, and graph complements
- On the power domination number of the Cartesian product of graphs
- The Zero Forcing Number of Graphs
- Using a new zero forcing process to guarantee the strong Arnold property
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- The minimum rank of universal adjacency matrices
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- The minimum rank of matrices and the equivalence class graph
- On zero forcing number of graphs and their complements
- 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
- Extremal values and bounds for the zero forcing number
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Propagation time for zero forcing on a graph
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- A new lower bound for the positive semidefinite minimum rank of a graph
- Minimum rank problems
- On minimum rank and zero forcing sets of a graph
- Techniques for determining the minimum rank of a small graph
- Zero forcing parameters and minimum rank problems
- Subgraph complementation and minimum rank
- On the complexity of failed zero forcing
- Zero forcing sets and bipartite circulants
- On the complexity of the positive semidefinite zero forcing number
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
- Positive semidefinite propagation time
- An upper bound for the minimum rank of a graph
- Minimum rank of skew-symmetric matrices described by a graph
- On graphs maximizing the zero forcing number
- The minimum rank of symmetric matrices described by a graph: a survey
- Maximum nullity and zero forcing of circulant graphs
- Some bounds on the zero forcing number of a graph
- On the minimum rank of regular classes of matrices of zeros and ones
- Positive semidefinite zero forcing: complexity and lower bounds
- On the zero forcing number of graphs and their splitting graphs
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs
- On the relationships between zero forcing numbers and certain graph coverings
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- Induced trees, minimum semidefinite rank, and zero forcing
- On extremal graphs for zero forcing number
- On the zero forcing number and spectral radius of graphs
- Lower bounds for positive semidefinite zero forcing and their applications
- On the total forcing number of a graph
- 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
- Positive semidefinite zero forcing
- Odd cycle zero forcing parameters and the minimum rank of graph blowups
- Bounds for minimum semidefinite rank from superpositions and cutsets
- Zero forcing propagation time on oriented graphs
- Infectious power domination of hypergraphs
- The extremal function and Colin de Verdière graph parameter
- Zero forcing in iterated line digraphs
- Maximum nullity, zero forcing number and propagation time of \(\ell\)-path graphs
- The inverse eigenvalue problem of a graph: multiplicities and minors
- Signed graphs with stable maximum nullity at most two
- Graphs with a unique maximum independent set up to automorphisms
- On the zero forcing number and propagation time of oriented graphs
- Upper bounds for positive semidefinite propagation time
- On the power domination number of graph products
- Forcing brushes
- The zero forcing polynomial of a graph
- Brushing number and zero-forcing number of graphs and their line graphs
- A lower bound on the zero forcing number
- Connected power domination in graphs
- A note on universally optimal matrices and field independence of the minimum rank of a graph
- Extremal \(k\)-forcing sets in oriented graphs
- The relationship between \(k\)-forcing and \(k\)-power domination
- Nordhaus-Gaddum problems for power domination
- The minimum rank problem for circulants
- A short proof of Zhou, Wong and Sun's conjecture
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- Throttling for the game of cops and robbers on graphs
- Line graphs: their maximum nullities and zero forcing numbers.
- Logic circuits from zero forcing
- On Grundy total domination number in product graphs
- On the critical ideals of complete multipartite graphs
- Families of graphs with maximum nullity equal to zero forcing number
- Total forcing sets and zero forcing sets in trees
- Complexity and inapproximability results for the power edge set problem
- A short proof for a lower bound on the zero forcing number
- Zero forcing for sign patterns
- Compressed cliques graphs, clique coverings and positive zero forcing
- Throttling positive semidefinite zero forcing propagation time on graphs
- Minimum rank of generalized star and complete bipartite graph with loops
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)
