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
• 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
• Computational approaches for zero forcing and related problems
• Graphs with real algebraic co-rank at most two
• The complexity of the positive semidefinite zero forcing
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Complexity and computation of connected zero forcing
• Connected zero forcing sets and connected propagation time of graphs
• The forcing number of graphs with given girth
• Grundy dominating sequences on \(X\)-join product
• Power domination in regular claw-free graphs
• On the relationship between the zero forcing number and path cover number for some graphs
• Note on power propagation time and lower bounds for the power domination number
• Restricted power domination and zero forcing problems
• Critical ideals, minimum rank and zero forcing number
• Throttling for standard zero forcing on directed graphs
• Immune sets in monotone infection rules. Characterization and complexity
• Zero forcing number, Grundy domination number, and their variants

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)