Zero forcing sets and the minimum rank of graphs

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

• 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

zbMATH Keywords

graphsymmetric matrixminimum rank

Mathematics Subject Classification ID

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)

• Zero forcing and maximum nullity for hypergraphs
• Probabilistic zero forcing on random graphs
• Positive semidefinite zero forcing numbers of two classes of graphs
• Grundy domination and zero forcing in Kneser graphs
• Blocking zero forcing processes in Cartesian products of graphs
• On the inverse eigenvalue problem for block graphs
• On the zero forcing number of generalized Sierpiński graphs
• On the zero forcing number of a graph involving some classical parameters
• Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems
• On the error of \textit{a priori} sampling: zero forcing sets and propagation time
• Properties of a \(q\)-analogue of zero forcing
• Grundy domination and zero forcing in regular graphs
• On the L-Grundy domination number of a graph
• Algorithms and applications for a class of bilevel MILPs
• Total forcing versus total domination in cubic graphs
• Uniform forcing and immune sets in graphs and hypergraphs
• Using Markov chains to determine expected propagation time for probabilistic zero forcing
• On leaky forcing and resilience
• Computing the zero forcing number for generalized Petersen graphs
• On the semitotal forcing number of a graph
• Zero forcing versus domination in cubic graphs
• Skew throttling
• The strong spectral property for graphs
• Constructions of cospectral graphs with different zero forcing numbers
• Zero forcing in claw-free cubic graphs
• On trees and unicyclic graphs with equal forcing-type numbers
• Minimum rank and zero forcing number for butterfly networks
• Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
• Approximating the minimum rank of a graph via alternating projection
• Graphs with equal Grundy domination and independence number
• On the nullity of a connected graph in terms of order and maximum degree
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• 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
• Note on forcing problem of trees
• Power domination in graphs
• Throttling for zero forcing and variants
• Zero forcing number of a graph in terms of the number of pendant vertices
• Zero forcing in triangulations
• Product throttling
• Tight bounds on probabilistic zero forcing on hypercubes and grids
• The language of epidemic
• Vertex sequences in graphs
• Z-domination game
• Various characterizations of throttling numbers
• A zero forcing technique for bounding sums of eigenvalue multiplicities
• Reconfiguration graphs of zero forcing sets
• Rigid linkages and partial zero forcing
• 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

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)